Related papers: The Simple Exclusion Process on the Circle has a d…
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…
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 totally asymmetric simple exclusion process in discrete time is considered on finite rings with fixed number of particles. A translation-invariant version of the backward-ordered sequential update is defined for periodic boundary…
A Brownian particle with diffusion coefficient $D$ is confined to a bounded domain of volume $V$ in $\rR^3$ by a reflecting boundary, except for a small absorbing window. The mean time to absorption diverges as the window shrinks, thus…
We consider the totally asymmetric simple exclusion process on a ring with flat and step initial conditions. We assume that the size of the ring and the number of particles tend to infinity proportionally and evaluate the fluctuations of…
It has been recently suggested that a totally asymmetric exclusion process with two species on an open chain could exhibit spontaneous symmetry breaking in some range of the parameters defining its dynamics. The symmetry breaking is…
In this paper, we use the eigenvalues of the random to random card shuffle to prove a sharp upper bound for the total variation mixing time. Combined with the lower bound due to Subag, we prove that this walk exhibits cutoff at $\frac{3}{4}…
This article gives sharp estimates for the mixing time of the Burnside process for Sylow $p$-double cosets in the symmetric group $S_n$. This process is a Markov chain on $S_n$ which can be used to uniformly sample Sylow $p$-double cosets.…
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…
Let $P$ be a bistochastic matrix of size $n$, and let $\Pi$ be a permutation matrix of size $n$. In this paper, we are interested in the mixing time of the Markov chain whose transition matrix is given by $Q=P\Pi$. In other words, the chain…
We consider a dynamic random graph on $n$ vertices that is obtained by starting from a random graph generated according to the configuration model with a prescribed degree sequence and at each unit of time randomly rewiring a fraction…
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 the mean first exit time $T_{\ve}$ of a particle diffusing in a circular or a spherical micro-domain with an impenetrable confining boundary containing a small escape window (EW) of an angular size $\ve$. Focusing on the effects of…
This paper explores the mixing time of the random transposition walk on permutations with one-sided interval restrictions. In particular, we're interested in the notion of cutoff, a phenomenon which occurs when mixing occurs in a window of…
We develop Markov chain mixing time estimates for a class of Markov chains with restricted transitions. We assume transitions may occur along a cycle of $n$ nodes and on $n^\gamma$ additional edges, where $\gamma < 1$. We find that the…
In earlier work (arXiv:1707.04927) the authors obtained formulas for the probability in the asymmetric simple exclusion process that at time $t$ a particle is at site $x$ and is the beginning of a block of $L$ consecutive particles. Here we…
Low-dimensional dynamical systems are fruitful models for mixing in fluid and granular flows. We study a one-dimensional discontinuous dynamical system (termed "cutting and shuffling" of a line segment), and we present a comprehensive…
A simple way to sample a uniform triangulation of the sphere with a fixed number $n$ of vertices is a Monte-Carlo method: we start from an arbitrary triangulation and flip repeatedly a uniformly chosen edge. We give a lower bound in…
Motivated by an exact mapping between anisotropic half integer spin quantum Heisenberg models and asymmetric diffusions on the lattice, we consider an anisotropic simple exclusion process with $N$ particles in a rectangle of $\bbZ^2$. Every…
The narrow escape problem concerns the time needed for a diffusing particle to exit a confining domain through a small hole in the boundary. While this problem is now well-understood, determining the escape time for a particle that must…