Random Matching in 2D with Exponent 2 for Gaussian Densities
Open Access
- 16 May 2024
- journal article
- research article
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 191 (5) , 1-34
Abstract
We solve the Random Euclidean Matching problem with exponent 2 for the Gaussian distribution defined on the plane. Previous works by Ledoux and Talagrand determined the leading behavior of the average cost up to a multiplicative constant. We explicitly determine the constant, showing that the average cost is proportional to $$(\log \, N)^2,$$ where N is the number of points. Our approach relies on a geometric decomposition allowing an explicit computation of the constant. Our results illustrate the potential for exact solutions of random matching problems for many distributions defined on unbounded domains on the plane.
Keywords
All Related Versions
Funding Information
- Sapienza Università di Roma (Ateneo 2019)
- PNRR MUR (PE0000013-FAIR)
- Università degli Studi di Roma La Sapienza
This publication has 28 references indexed in Scilit:
- A PDE approach to a 2-dimensional matching problemProbability Theory and Related Fields, 2018
- Optimal Transport for Applied Mathematicians2015
- On the rate of convergence in Wasserstein distance of the empirical measureProbability Theory and Related Fields, 2014
- Upper and Lower Bounds for Stochastic Processes2014
- Combinatorial Optimization Over Two Random Point Sets2013
- Optimal Transport2009
- A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problemNumerische Mathematik, 2000
- Transportation cost for Gaussian and other product measuresGeometric and Functional Analysis, 1996
- Asymptotics for transportation cost in high dimensionsJournal of Theoretical Probability, 1995
- On optimal matchingsCombinatorica, 1984