SearcharxivSearch

arXiv · 2512.24307

Universality of cutoff for independent random walks on the circle conditioned not to intersect

Abstract

In the present paper, we consider a class of Markov processes on the discrete circle which has been introduced by K\"onig, O'Connell and Roch. These processes describe movements of exchangeable interacting particles and are discrete analogues of the unitary Dyson Brownian motion: a random number of particles jump together either to the left or to the right, with trajectories conditioned to never intersect. We provide asymptotic mixing times for stochastic processes in this class as the number of particles goes to infinity, under a sub-Gaussian assumption on the random number of particles moving at each step. As a consequence, we prove that a cutoff phenomenon holds independently of the transition probabilities, subject only to the sub-Gaussian assumption and a minimal aperiodicity hypothesis. Finally, an application to dimer models on the hexagonal lattice is provided.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anna Ben-Hamou, Pierre Tarrago. 2025-12-30. Universality of cutoff for independent random walks on the circle conditioned not to intersect. https://arxiv.org/abs/2512.24307

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