arbiter
JournalsAccount

Optimal matching problem on the Boolean cube

Shi Feng

Bernoulli2026https://doi.org/10.3150/25-bej1919article
ABDC A
Weight
0.50

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.

Open via your library →

Cite this paper

https://doi.org/https://doi.org/10.3150/25-bej1919

Or copy a formatted citation

@article{shi2026,
  title        = {{Optimal matching problem on the Boolean cube}},
  author       = {Shi Feng},
  journal      = {Bernoulli},
  year         = {2026},
  doi          = {https://doi.org/https://doi.org/10.3150/25-bej1919},
}

Paste directly into BibTeX, Zotero, or your reference manager.

Flag this paper

Optimal matching problem on the Boolean cube

Flags are reviewed by the Arbiter methodology team within 5 business days.

Evidence weight

0.50

Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40

F · citation impact0.50 × 0.4 = 0.20
M · momentum0.50 × 0.15 = 0.07
V · venue signal0.50 × 0.05 = 0.03
R · text relevance †0.50 × 0.4 = 0.20

† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.