SearcharxivSearch

arXiv · 2603.17861

Gaussian concentration, integral probability metrics, and coupling functionals for infinite lattice systems

Abstract

We develop a transport-entropy framework for Gaussian concentration inequalities on the infinite product space $S^{\mathbb Z^d}$, where $S$ is a finite set, in which sensitivity is measured by the $\ell^2$-norm of local oscillations. We show that the associated transportation costs cannot be induced by any metric or cost function on the configuration space, due to a structural lack of extensivity in infinite product spaces. Our main result proves that the associated integral probability metric and coupling functional coincide in finite volume, yielding a duality extending the classical Kantorovich-Rubinstein theorem beyond the metric setting. As a consequence, Marton's coupling inequality in all finite volumes is equivalent to Gaussian concentration, yielding a new characterization in the infinite-product setting. In the translation-invariant setting, the corresponding metrics converge in the thermodynamic limit to the $\bar d$-metric. We further introduce a thermodynamic Gaussian concentration bound and prove its equivalence with a transport-entropy inequality involving the relative entropy density.

Explore related subjects

Keep this discovery

BibTeXRIS

J. -R. Chazottes, P. Collet, F. Redig. 2026-03-18. Gaussian concentration, integral probability metrics, and coupling functionals for infinite lattice systems. https://arxiv.org/abs/2603.17861

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR