SearcharxivSearch

arXiv · 2501.13079

A new cutoff criterion for non-negatively curved chains

Abstract

The cutoff phenomenon was recently shown to systematically follow from non-negative curvature and the product condition, for all Markov diffusions. The proof crucially relied on a classical \emph{chain rule} satisfied by the carr\'e du champ operator, which is specific to differential generators and hence fails on discrete spaces. In the present paper, we show that an approximate version of this chain rule in fact always holds, with an extra cost that depends on the log-Lipschitz regularity of the considered observable. As a consequence, we derive a new cutoff criterion for non-negatively curved chains on finite spaces. The latter allows us to recover, in a simple and unified way, a number of historical instances of cutoff that had been established through model-specific arguments. Emblematic examples include random walk on the hypercube, random transpositions, random walk on the multislice, or MCMC samplers for popular spin systems such as the Ising and Hard-core models on bounded-degree graphs.

Explore related subjects

Keep this discovery

BibTeXRIS

Francesco Pedrotti, Justin Salez. 2025-01-22. A new cutoff criterion for non-negatively curved chains. https://arxiv.org/abs/2501.13079

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