A simple Fourier analytic proof of the AKT optimal matching theorem
Sergey Bobkov, Michel Ledoux

TL;DR
This paper provides an elementary Fourier analytic proof of the AKT optimal matching theorem in two dimensions, extending its applicability to dependent samples and connecting to PDE methods for bounds.
Contribution
It introduces a simple, Fourier-based proof of the AKT theorem and adapts it for dependent samples, broadening the theorem's scope and understanding.
Findings
Elementary Fourier proof of AKT theorem in 2D
Extension to dependent sample distributions
Connection to PDE approaches for bounds
Abstract
We present a short and elementary proof of the Ajtai-Koml\'os-Tusn\'ady (AKT) optimal matching theorem in dimension 2 via Fourier analysis and a smoothing argument. The upper bound applies to more general families of samples, including dependent variables, of interest in the study of rates of convergence for empirical measures. Following the recent pde approach by L. Ambrosio, F. Stra and D. Trevisan, we also adapt a simple proof of the lower bound.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMarkov Chains and Monte Carlo Methods · Quantum chaos and dynamical systems · Mathematical Dynamics and Fractals
