Subadditivity and optimal matching of unbounded samples
Preprint
Abstract
We obtain new bounds for the optimal matching cost for empirical measures with unbounded support. For a large class of radially symmetric and rapidly decaying probability laws, we prove for the first time the asymptotic rate of convergence for the whole range of power exponents $p$ and dimensions $d$. Moreover we identify the exact prefactor when $p\le d$. We cover in particular the Gaussian case, going far beyond the currently known bounds. Our proof technique is based on approximate sub- and super-additivity bounds along a geometric decomposition adapted to some features the density, such as its radial symmetry and its decay at infinity.
Keywords
All Related Versions
This publication has 21 references indexed in Scilit:
- Random Matching in 2D with Exponent 2 for Gaussian DensitiesJournal of Statistical Physics, 2024
- Optimal transport methods for combinatorial optimization over two random point setsProbability Theory and Related Fields, 2023
- There is no stationary cyclically monotone Poisson matching in 2dProbability Theory and Related Fields, 2023
- Euclidean Random Matching in 2D for Non-constant DensitiesJournal of Statistical Physics, 2020
- Scaling and non-standard matching theoremsComptes Rendus Mathematique, 2018
- A PDE approach to a 2-dimensional matching problemProbability Theory and Related Fields, 2018
- On the rate of convergence in Wasserstein distance of the empirical measureProbability Theory and Related Fields, 2014
- A new transportation distance between non-negative measures, with applications to gradients flows with Dirichlet boundary conditionsJournal de Mathématiques Pures et Appliquées, 2010
- Probability Theory of Classical Euclidean Optimization Problems1998
- Poincaré’s inequalities and Talagrand’s concentration phenomenon for the exponential distributionProbability Theory and Related Fields, 1997