logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Optimal matching problem on the Boolean cube

delete2026-05-01
delete0
PRE
AI
F
Feng, Shi *
DOI：10.3150/25-bej1919delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

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
Bernoulli
IF:
1.7
Papers:
106
Citations:
0

Organization

C
cornell university
Scholars:
5.1K
Papers: 2.1K
Citations: 0