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 Socially Responsible Investment by Gabriele Sicuro
Cover of the book Principles of Spread-Spectrum Communication Systems by Gabriele Sicuro
Cover of the book Emerging Technologies for Education by Gabriele Sicuro
Cover of the book Small Molecule Therapeutics for Schizophrenia by Gabriele Sicuro
Cover of the book Perspectives on Atmospheric Sciences by Gabriele Sicuro
Cover of the book The Aero- and Hydromechanics of Keel Yachts by Gabriele Sicuro
Cover of the book Structure of Approximate Solutions of Optimal Control Problems by Gabriele Sicuro
Cover of the book Ethnobiology of Corals and Coral Reefs by Gabriele Sicuro
Cover of the book Waters of Brazil by Gabriele Sicuro
Cover of the book The Role of Deposit Guarantee Schemes as a Financial Safety Net in the European Union by Gabriele Sicuro
Cover of the book Clinical Trials in Latin America: Where Ethics and Business Clash by Gabriele Sicuro
Cover of the book Advances in Robust Fractional Control by Gabriele Sicuro
Cover of the book American Presidential Candidate Spouses by Gabriele Sicuro
Cover of the book Extreme States of Matter by Gabriele Sicuro
Cover of the book Advanced Engineering for Processes and Technologies 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