Optimal Matching Problem on the Boolean Cube
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 bobkov2021simple, as well as methods from large deviations theory.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.