SearcharxivSearch

arXiv · 2403.20010

Cutoff for the transience and mixing time of a SSEP with traps and consequences on the FEP

Abstract

We introduce a new particle system that we call the SSEP with traps, which is non reversible, attractive, and has a transient regime. We study its \emph{transience time} $\theta_K$, meaning the time after which the system is no longer in a transient state with high probability, on the ring with $K$ sites. We first show that $\theta_K$ is of order $K^2 \log K$ for a system of size $K$, and more precisely that it exhibits a cutoff at time $\frac{1}{\pi^2} K^2 \log K$. We then show that its \emph{mixing time} also undergoes cutoff at the same time. We further define a new mapping between the SSEP with traps and the Facilitated Exclusion Process (FEP) which has attracted significant scrutiny in recent years. We expect that this mapping will be a very useful tool to study the FEP's microscopic and macroscopic behaviour. In particular, using this mapping, we show that the FEP's transience time also undergoes a cutoff at time $\frac{1}{4 \pi^2} N^2 \log N$. Notably, our results show that for a FEP with particle density strictly greater than $\frac12$, the transient component is exited in a diffusive time. This allows to extend the upper-bound from [Ayre Chleboun 2024] for the mixing time of the FEP with particle density $\rho > 1/2$.

Explore related subjects

Keep this discovery

BibTeXRIS

Clément Erignoux, Brune Massoulié. 2024-03-29. Cutoff for the transience and mixing time of a SSEP with traps and consequences on the FEP. https://arxiv.org/abs/2403.20010

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