Related papers: Cutoff for East models
We identify the asymptotic distribution of the chemical distance in high-dimensional critical Bernoulli percolation. Namely, we show that the distance between the origin and a distant vertex conditioned to lie in the cluster of the origin…
The elastic backbone is the set of all shortest paths. We found a new phase transition at $p_{eb}$ above the classical percolation threshold at which the elastic backbone becomes dense. At this transition in $2d$ its fractal dimension is…
Markov chains on the non-negative quadrant of dimension $d$ are often used to model the stochastic dynamics of the number of $d$ entities, such as $d$ chemical species in stochastic reaction networks. The infinite state space poses…
We prove that the mixing time of driven-dissipative activated random walk on an interval of length $n$ with uniform or central driving exhibits cutoff at $n$ times the critical density for activated random walk on the integers. The proof…
It has been shown that a hot and dense deconfined nuclear matter state produced in ultra-relativistic heavy-ion collisions, can be quantitatively described by the String Percolation phenomenological model. The model address the phase…
Introduced in 1963, Glauber dynamics is one of the most practiced and extensively studied methods for sampling the Ising model on lattices. It is well known that at high temperatures, the time it takes this chain to mix in $L^1$ on a system…
Plaquette models are short range ferromagnetic spin models that play a key role in the dynamic facilitation approach to the liquid glass transition. In this paper we study the dynamics of the square plaquette model at the smallest of the…
Chase-escape percolation is a variation of the standard epidemic spread models. In this model, each site can be in one of three states: unoccupied, occupied by a single prey, or occupied by a single predator. Prey particles spread to…
We consider the multicolour East model, a model of glass forming liquids closely related to the East model on $\mathbb{Z}^d$. The state space ${(G\cup \{\star\})}^{\mathbb{Z}^d}$ consists of $|G|\le 2^d$ different vacancy types and the…
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…
Given a sequence $(\mathfrak{X}_i, \mathscr{K}_i)_{i=1}^\infty$ of Markov chains, the cut-off phenomenon describes a period of transition to stationarity which is asymptotically lower order than the mixing time. We study mixing times and…
Information percolation is a new method for analyzing stochastic spin systems through classifying and controlling the clusters of information-flow in the space-time slab. It yielded sharp mixing estimates (cutoff with an $O(1)$-window) for…
The half-orthant model is a partially oriented model of a random medium involving a parameter $p\in [0,1]$, for which there is a critical value $p_c(d)$ (depending on the dimension $d$) below which every point is reachable from the origin.…
We prove a general theorem on cutoffs for symmetric simple exclusion processes on graphs with open boundaries, under the natural assumption that the graphs converge geometrically and spectrally to a compact metric measure space with…
We consider a heat conduction model introduced in \cite{Collet-Eckmann 2009}. This is an open system in which particles exchange momentum with a row of (fixed) scatterers. We assume simplified bath conditions throughout, and give a…
We consider the contact process on a countable-infinite and connected graph of bounded degree. For this process started from the upper invariant measure, we prove certain uniform mixing properties under the assumption that the infection…
Environmental heterogeneity can drive genetic heterogeneity in expanding populations; mutant strains may emerge that trade overall growth rate for an improved ability to survive in patches that are hostile to the wild type. This…
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…
In Poisson percolation each edge becomes open after an independent exponentially distributed time with rate that decreases in the distance from the origin. As a sequel to our work on the square lattice, we describe the limiting shape of the…
In a series of recent works, Boyd, Diaconis, and their co-authors have introduced a semidefinite programming approach for computing the fastest mixing Markov chain on a graph of allowed transitions, given a target stationary distribution.…