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 Musculoskeletal Research and Basic Science by Gabriele Sicuro
Cover of the book Nature, Artforms, and the World Around Us by Gabriele Sicuro
Cover of the book Information Security and Cryptology - ICISC 2014 by Gabriele Sicuro
Cover of the book Smart Working, Living and Organising by Gabriele Sicuro
Cover of the book Audiovisual Quality Assessment and Prediction for Videotelephony by Gabriele Sicuro
Cover of the book Handbook of Sustainability Science and Research by Gabriele Sicuro
Cover of the book Advances in Knowledge Discovery and Data Mining by Gabriele Sicuro
Cover of the book International Development Organizations and Fragile States by Gabriele Sicuro
Cover of the book Research and Development in Intelligent Systems XXXIII by Gabriele Sicuro
Cover of the book The Composition of Sense in Gertrude Stein's Landscape Writing by Gabriele Sicuro
Cover of the book Language and Automata Theory and Applications by Gabriele Sicuro
Cover of the book Russia and the European Union by Gabriele Sicuro
Cover of the book Antisocial Media by Gabriele Sicuro
Cover of the book Hemomath by Gabriele Sicuro
Cover of the book Islamic Finance, Risk-Sharing and Macroeconomic Stability 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