.png){kind=icon}
Return
Optimal matching problem on the Boolean cube
.png){kind=icon}
PRE
AI
DOI：10.3150/25-bej1919.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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:
Boolean cube
optimal matching problem
Journal
B
IF:
1.7
Papers:
106
Citations:
0
Organization
Cited Papers
ShareSaveShareSaveShareSaveShareSaveSharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance.png)
Bernoulli
OAAI
BernoulliIF0
OAAIShareSaveShareSaveShareSave
View more