Related papers: Cutoff phenomenon for the asymmetric simple exclus…
We survey recent results concerning the total-variation mixing time of the simple exclusion process on the segment (symmetric and asymmetric) and a continuum analog, the simple random walk on the simplex with an emphasis on cutoff results.…
This paper studies the mixing behavior of the Asymmetric Simple Exclusion Process (ASEP) on a segment of length $N$. Our main result is that for particle densities in $(0,1),$ the total-variation cutoff window of ASEP is $N^{1/3}$ and the…
Discovered in the context of card shuffling by Aldous, Diaconis and Shahshahani, the cutoff phenomenon has since then been established in a variety of Markov chains. However, proving cutoff remains a delicate affair, which requires a…
We compute the mixing time of the Facilitated Exclusion Process (FEP) and obtain cutoff and pre-cutoff in different regimes. The main tool to obtain this result is a new bijective, deterministic mapping between the joint law of an ergodic…
We investigate the mixing time of the asymmetric Zero Range process on the segment with a non-decreasing rate. We show that the cutoff holds in the totally asymmetric case with a convex flux, and also with a concave flux if the asymmetry is…
We study mixing times of the symmetric and asymmetric simple exclusion process on the segment where particles are allowed to enter and exit at the endpoints. We consider different regimes depending on the entering and exiting rates as well…
We consider the simple exclusion process with $k$ particles on a segment of length $N$ performing random walks with transition $p>1/2$ to the right and $q=1-p$ to the left. We focus on the case where the asymmetry in the jump rates…
We investigate the asymptotic in $N$ of the mixing times of a Markov dynamics on $N-1$ ordered particles in an interval. This dynamics consists in resampling at independent Poisson times each particle according to a probability measure on…
The asymmetric simple exclusion process (ASEP) is a model for translation in protein synthesis and traffic flow; it can be defined as a Markov chain describing particles hopping on a one-dimensional lattice. In this article I give an…
A finite ergodic Markov chain is said to exhibit cutoff if its distance to stationarity remains close to 1 over a certain number of iterations and then abruptly drops to near 0 on a much shorter time scale. Discovered in the context of card…
As the simplest model of transport of interacting particles in a disordered medium, we consider the asymmetric simple exclusion process (ASEP) in which particles with hard-core interactions perform biased random walks, on the supercritical…
We study the asymmetric simple exclusion process (ASEP) on a segment $\{1,\ldots,b_N\}$ and are interested in its total variation distance to equilibrium when started from an initial configuration $\xi^{N}$. We provide a general result…
We investigate the mixing time of the capacity $k$ simple exclusion process (also called the partial exclusion process) of Schultz and Sandow with $m$ particles on a segment of length $N$. We show that the $k$-SEP exhibits cutoff at time…
We consider the Metropolis biased card shuffling (also called the multi-species ASEP on a finite interval or the random Metropolis scan). Its convergence to stationary was believed to exhibit a total-variation cutoff, and that was proved a…
We consider the asymmetric simple exclusion process (ASEP) on a semi-infinite chain which is coupled at the end to a reservoir with a particle density that changes periodically in time. It is shown that the density profile assumes a…
We consider the zero-range process with arbitrary bounded monotone rates on the complete graph, in the regime where the number of sites diverges while the density of particles per site converges. We determine the asymptotics of the mixing…
Bidirectional transport in (quasi) one-dimensional systems generically leads to cluster-formation and small particle currents. This kind of transport can be described by the asymmetric simple exclusion process (ASEP) with two species of…
We investigate the mixing properties of a model of reversible Markov chains in random environment, which notably contains the simple random walk on the superposition of a deterministic graph and a second graph whose vertex set has been…
We study mixing times for the totally asymmetric simple exclusion process (TASEP) on a circle of length $N$ with $k$ particles. We show that the mixing time is of order $N^2 \min(k,N-k)^{-1/2}$, and that the cutoff phenomenon does not…
We study the time that the simple exclusion process on the complete graph needs to reach equilibrium in terms of total variation distance. For the graph with n vertices and 1<<k<n/2 particles we show that the mixing time is of order…