Related papers: The Simple Exclusion Process on the Circle has a d…
Percolation with edge-passage probability p and first-passage percolation are studied for the n-cube B_n ={0,1}^n with nearest neighbor edges. For oriented and unoriented percolation, p=e/n and p=1/n are the respective critical…
Motivated by kinetically constrained interacting particle systems (KCM), we consider a reversible coalescing and branching simple exclusion process on a general finite graph $G=(V,E)$ dual to the biased voter model on $G$. Our main goal are…
We investigate a novel variant of the exclusion process in which particles perform asymmetric nearest-neighbor jumps across a bond \((k, k+1)\) only if the preceding site \((k-1)\) is unoccupied. This next-nearest-neighbor constraint…
We consider a synchronous process of particles moving on the vertices of a graph $G$, introduced by Cooper, McDowell, Radzik, Rivera and Shiraga (2018). Initially, $M$ particles are placed on a vertex of $G$. In subsequent time steps, all…
Attractiveness is a fundamental tool to study interacting particle systems and the basic coupling construction is a usual route to prove this property, as for instance in the simple exclusion process. We consider here general exclusion…
Define $(X_n)$ on $\mathbf{Z}/q\mathbf{Z}$ by $X_{n+1} = 2X_n + b_n$, where the steps $b_n$ are chosen independently at random from $-1, 0, +1$. The mixing time of this random walk is known to be at most $1.02 \log_2 q$ for almost all odd…
We establish cutoff for a natural random walk (RW) on the set of perfect matchings (PMs). An $n$-PM is a pairing of $2n$ objects. The $k$-PM RW selects $k$ pairs uniformly at random, disassociates the corresponding $2k$ objects, then…
We consider the random walk on the hypercube which moves by picking an ordered pair $(i,j)$ of distinct coordinates uniformly at random and adding the bit at location $i$ to the bit at location $j$, modulo $2$. We show that this Markov…
We study the mixing time of a random walker who moves inside a dynamical random cluster model on the d-dimensional torus of side-length n. In this model, edges switch at rate \mu between open and closed, following a Glauber dynamics for the…
A traffic model on an open one-dimensional lattice is considered. At any discrete time moment, with prescribed probability, a particle arrives to the leftmost cell of the lattice, and, with prescribed probability, the arriving particle…
We determine diameters of Markov chains describing one-dimensional N -particle models with an exclusion interaction, namely the Ssep (symmetric simple exclusion process) and one of its non-reversible liftings, the lifted Tasep (totally…
We consider the problem of cutting a set of edges on a polyhedral manifold surface, possibly with boundary, to obtain a single topological disk, minimizing either the total number of cut edges or their total length. We show that this…
The basic model of the non-equilibrium low dimensional physics the so-called totally asymmetric exclusion process is related to the 'crystalline limit' ($q\to\infty$) of the $SU_q(2)$ quantum algebra. Using the quantum inverse scattering…
Determining the mixing time of Kac's random walk on the sphere $\mathrm{S}^{n-1}$ is a long-standing open problem. We show that the total variation mixing time of Kac's walk on $\mathrm{S}^{n-1}$ is between $\frac{1}{2} \, n \log(n)$ and…
Through a Metropolis-like algorithm with single step computational cost of order one, we build a Markov chain that relaxes to the canonical Fermi statistics for k non-interacting particles among m energy levels. Uniformly over the…
We introduce a new framework for analyzing Glauber dynamics for the Ising model. The traditional approach for obtaining sharp mixing results has been to appeal to estimates on spatial properties of the stationary measure from within a…
The narrow escape problem deals with the calculation of the mean escape time (MET) of a Brownian particle from a bounded domain through a small hole on the domain's boundary. Here we develop a formalism that allows us to evaluate the…
We consider an inhomogeneous symmetric simple exclusion process on a one-dimensional lattice with open boundary conditions. The time scale is continuous. Particles of different types arrive to the utmost left and the utmost right site. If a…
We study a recently introduced model which consists of positive and negative particles on a ring. The positive (negative) particles hop clockwise (counter-clockwise) with rate 1 and oppositely charged particles may swap their positions with…
We study the forgetting properties of the particle filter when its state - the collection of particles - is regarded as a Markov chain. Under a strong mixing assumption on the particle filter's underlying Feynman-Kac model, we find that the…