Optimal matching problem on the Boolean cube
Author:
- 1 May 2026
- journal article
- Published by Bernoulli Society for Mathematical Statistics and Probability in Bernoulli
- Vol. 32 (2) , 1547-1569
Abstract
We establish upper and lower bounds for the expected Wasserstein-1 distance between the random empirical measure and the uniform measure on the Boolean cube. Our analysis leverages techniques from Fourier analysis, following the framework introduced in (Ann. Appl. Probab. 31 (2021) 2567–2584), as well as methods from large deviations theory.Keywords
All Related Versions
This publication has 15 references indexed in Scilit:
- 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
- Analysis of Boolean Functions2014
- Upper and Lower Bounds for Stochastic Processes2014
- Constructive quantization: Approximation by empirical measuresAnnales de l'Institut Henri Poincaré, Probabilités et Statistiques, 2013
- Combinatorial Optimization Over Two Random Point Sets2013
- Concentration Inequalities2013
- Optimal Transport2009
- Asymptotics for transportation cost in high dimensionsJournal of Theoretical Probability, 1995
- On optimal matchingsCombinatorica, 1984