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 Subsecond Annealing of Advanced Materials by Gabriele Sicuro
Cover of the book Social Factors and Community Well-Being by Gabriele Sicuro
Cover of the book Bronchopulmonary Dysplasia by Gabriele Sicuro
Cover of the book Patient-Derived Xenograft Models of Human Cancer by Gabriele Sicuro
Cover of the book Adult Umbilical Reconstruction by Gabriele Sicuro
Cover of the book Introduction to the Theory of Lie Groups by Gabriele Sicuro
Cover of the book Recent Advances in Complex Functional Materials by Gabriele Sicuro
Cover of the book Resummation and Renormalization in Effective Theories of Particle Physics by Gabriele Sicuro
Cover of the book The Local Configuration of New Research Fields by Gabriele Sicuro
Cover of the book Benedetto Cotrugli – The Book of the Art of Trade by Gabriele Sicuro
Cover of the book Gold Nanostars by Gabriele Sicuro
Cover of the book Handbook of Consultation-Liaison Psychiatry by Gabriele Sicuro
Cover of the book Challenges in Mechanics of Time-Dependent Materials, Volume 2 by Gabriele Sicuro
Cover of the book Model Checking Software by Gabriele Sicuro
Cover of the book Taylor Coefficients and Coefficient Multipliers of Hardy and Bergman-Type Spaces 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