Optimal Matching Problem on the Boolean Cube
Probability
2025-04-16 v2
Abstract
We establish upper and lower bounds for the expected Wasserstein 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 \cite{bobkov2021simple}, as well as methods from large deviations theory.
Keywords
Cite
@article{arxiv.2503.16713,
title = {Optimal Matching Problem on the Boolean Cube},
author = {Shi Feng},
journal= {arXiv preprint arXiv:2503.16713},
year = {2025}
}
Comments
26 pages, 0 figure