Related papers: The Simple Exclusion Process on the Circle has a d…
We study the multi-component Ising model, which is also known as the block Ising model. In this model, the particles are partitioned into a fixed number of groups with a fixed proportion, and the interaction strength is determined by the…
Condensation is characterized with a single macroscopic condensate whose mass is proportional to a system size $N$. We demonstrate how important particle interactions are in condensation phenomena. We study a modified version of the…
This note proves an upper bound for the fluctuations of a second-class particle in the totally asymmetric simple exclusion process. The proof needs a lower tail estimate for the last-passage growth model associated with the exclusion…
The target of our study is to approximate numerically and, in some particular physically relevant cases, also analytically, the residence time of particles undergoing an asymmetric simple exclusion dynamics on a stripe. The source of…
We show that the total-variation mixing time of the lamplighter random walk on fractal graphs exhibit sharp cutoff when the underlying graph is transient (namely of spectral dimension greater than two). In contrast, we show that such cutoff…
We consider the one dimensional totally asymmetric simple exclusion process with initial product distribution with densities $0 \leq \rho_0 < \rho_1 <...< \rho_n \leq 1$ in $(-\infty,c_1\ve^{-1})$, $[c_1\ve^{-1},c_2\epsilon^{-1}),...,[c_n…
The random-cluster model with parameters $(p,q)$ is a random graph model that generalizes bond percolation ($q=1$) and the Ising and Potts models ($q\geq 2$). We study its Glauber dynamics on $n\times n$ boxes $\Lambda_{n}$ of the integer…
Let $(X_t)_{t = 0 }^{\infty}$ be an irreducible reversible discrete time Markov chain on a finite state space $\Omega $. Denote its transition matrix by $P$. To avoid periodicity issues (and thus ensuring convergence to equilibrium) one…
We introduce and analyze the $S_k$ shuffle on $N$ cards, a natural generalization of the celebrated random adjacent transposition shuffle. In the $S_k$ shuffle, we choose uniformly at random a block of $k$ consecutive cards, and shuffle…
We study here the escape time for the fastest diffusing particle from the boundary of an interval with point-sink killing sources. Killing represents a degradation that leads to the probabilistic removal of the moving Brownian particles. We…
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…
We consider an ordinary differential equation with a unique hyperbolic attractor at the origin, to which we add a small random perturbation. It is known that under general conditions, the solution of this stochastic differential equation…
In this paper we study some conditional probabilities for the totally asymmetric simple exclusion processes (TASEP) with second class particles. To be more specific, we consider a finite system with one first class particle and $N-1$ second…
A multi-species generalization of the Asymmetric Simple Exclusion Process (ASEP) has been considered in the presence of a single impurity on a ring. The model describes particles hopping in one direction with stochastic dynamics and hard…
We address the question of whether a point inside a domain bounded by a simple closed arc spline is circularly visible from a specified arc from the boundary. We provide a simple and numerically stable linear time algorithm that solves this…
We consider the symmetric simple exclusion process in the interval $[-N,N]$ with additional birth and death processes respectively on $(N-K,N]$, $K>0$, and $[-N,-N+K)$. The exclusion is speeded up by a factor $N^2$, births and deaths by a…
We study an interacting particle process on a finite ring with $L$ sites with at most $K$ particles per site, in which particles hop to nearest neighbors with rates given in terms of $t$-deformed integers and asymmetry parameter $q$, where…
Partial mutual exclusion is the drinking philosophers problem for complete graphs. It is the problem that a process may enter a critical section CS of its code only when some finite set nbh of other processes are not in their critical…
The cutoff phenomenon is an abrupt transition from out of equilibrium to equilibrium undergone by certain Markov processes in the limit where the size of the state space tends to infinity: instead of decaying gradually over time, their…
A Gilbert-Shannon-Reeds (GSR) shuffle is performed on a deck of $N$ cards by cutting the top $n\sim Bin(N,1/2)$ cards and interleaving the two resulting piles uniformly at random. The celebrated "Seven shuffles suffice" theorem of…