The Euclidean Matching Problem

Nonfiction, Science & Nature, Science, Physics, Mathematical Physics, General Physics
Cover of the book The Euclidean Matching Problem by Gabriele Sicuro, Springer International Publishing
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Gabriele Sicuro ISBN: 9783319465777
Publisher: Springer International Publishing Publication: October 24, 2016
Imprint: Springer Language: English
Author: Gabriele Sicuro
ISBN: 9783319465777
Publisher: Springer International Publishing
Publication: October 24, 2016
Imprint: Springer
Language: English

This thesis discusses the random Euclidean bipartite matching problem, i.e., the matching problem between two different sets of points randomly generated on the Euclidean domain. The presence of both randomness and Euclidean constraints makes the study of the average properties of the solution highly relevant. The thesis reviews a number of known results about both matching problems and Euclidean matching problems. It then goes on to provide a complete and general solution for the one dimensional problem in the case of convex cost functionals and, moreover, discusses a potential approach to the average optimal matching cost and its finite size corrections in the quadratic case. The correlation functions of the optimal matching map in the thermodynamical limit are also analyzed. Lastly, using a functional approach, the thesis puts forward a general recipe for the computation of the correlation function of the optimal matching in any dimension and in a generic domain.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

This thesis discusses the random Euclidean bipartite matching problem, i.e., the matching problem between two different sets of points randomly generated on the Euclidean domain. The presence of both randomness and Euclidean constraints makes the study of the average properties of the solution highly relevant. The thesis reviews a number of known results about both matching problems and Euclidean matching problems. It then goes on to provide a complete and general solution for the one dimensional problem in the case of convex cost functionals and, moreover, discusses a potential approach to the average optimal matching cost and its finite size corrections in the quadratic case. The correlation functions of the optimal matching map in the thermodynamical limit are also analyzed. Lastly, using a functional approach, the thesis puts forward a general recipe for the computation of the correlation function of the optimal matching in any dimension and in a generic domain.

More books from Springer International Publishing

Cover of the book Human-Computer Interaction – INTERACT 2017 by Gabriele Sicuro
Cover of the book Advances in Shape Memory Materials by Gabriele Sicuro
Cover of the book Sustainable Rail Transport by Gabriele Sicuro
Cover of the book South Asian Rivers by Gabriele Sicuro
Cover of the book Models, Simulation, and Experimental Issues in Structural Mechanics by Gabriele Sicuro
Cover of the book Mathematical Cardiac Electrophysiology by Gabriele Sicuro
Cover of the book The Politics of Postmemory by Gabriele Sicuro
Cover of the book Poetry And Imagined Worlds by Gabriele Sicuro
Cover of the book Food Law and Regulation for Non-Lawyers by Gabriele Sicuro
Cover of the book Heterogeneous Catalysis and its Industrial Applications by Gabriele Sicuro
Cover of the book Hydrogeomorphic Risk Analysis Affecting Chalcolithic Archaeological Sites from Valea Oii (Bahlui) Watershed, Northeastern Romania by Gabriele Sicuro
Cover of the book Immunohematology and Transfusion Medicine by Gabriele Sicuro
Cover of the book Electrochemistry of N4 Macrocyclic Metal Complexes by Gabriele Sicuro
Cover of the book Cryptic Female Choice in Arthropods by Gabriele Sicuro
Cover of the book Theoretical Aspects of Computing – ICTAC 2017 by Gabriele Sicuro
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy