Wasserstein Concentration of Empirical Measures for Dependent Data via the Method of Moments
Arash A. Amini, Luciano Vinas
TL;DR
The paper proves a general $W_1$-concentration result for the empirical measure of dependent data by only requiring asymptotic control of empirical moments and a flexible $\Psi_{r_n}$-sub-Gaussian tail condition. It leverages the method of moments and a Chebyshev–Jackson polynomial approximation to transfer moment concentration into Lipschitz-test concentration, yielding a robust convergence result beyond i.i.d. or strongly mixing scenarios. The authors extend the scalar result to random vectors via a projection-based lifting argument, enabling high-dimensional applicability. The approach provides a practical framework for concentration in settings with complex dependencies, such as random matrices, particle systems, or graph-based models, and introduces explicit polynomial-approximation tools with controlled coefficients to bridge moment and topological concentration.
Abstract
We establish a general concentration result for the 1-Wasserstein distance between the empirical measure of a sequence of random variables and its expectation. Unlike standard results that rely on independence (e.g., Sanov's theorem) or specific mixing conditions, our result requires only two conditions: (1) control over the variance of the empirical moments, and (2) a flexible tail condition we term $Ψ_{r_n}$-sub-Gaussianity. This approach allows for significant dependencies between variables, provided their algebraic moments behave predictably. The proof uses the method of moments combined with a polynomial approximation of Lipschitz functions via Jackson kernels, allowing us to translate moment concentration into topological concentration.
