SearcharxivSearch

arXiv · 2409.16869

Concentration of information on discrete groups

Abstract

Motivated by the Asymptotic Equipartition Property and its recently discovered role in the cutoff phenomenon, we initiate the systematic study of varentropy on discrete groups. Our main result is an approximate tensorization inequality which asserts that the varentropy of any conjugacy-invariant random walk is, up to a universal multiplicative constant, at most that of the free Abelian random walk with the same jump rates. In particular, it is always bounded by the number d of generators, uniformly in time and in the size of the group. This universal estimate is sharp and can be seen as a discrete analogue of a celebrated result of Bobkov and Madiman concerning random d-dimensional vectors with a log-concave density (AOP 2011). A key ingredient in our proof is the fact that conjugacy-invariant random walks have non-negative Bakry-\'Emery curvature, a result which seems new and of independent interest.

Explore related subjects

Keep this discovery

BibTeXRIS

Jonathan Hermon, Xiangying Huang, Francesco Pedrotti, Justin Salez. 2024-09-25. Concentration of information on discrete groups. https://arxiv.org/abs/2409.16869

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