Related papers: Cutoff for the mean-field zero-range process
Condensation phenomena in non-equilibrium systems have been modeled by the zero-range process, which is a model of particles hopping between boxes with Markovian dynamics. In many cases, memory effects in the dynamics cannot be neglected.…
We study convergence to equilibrium for a large class of Markov chains in random environment. The chains are sparse in the sense that in every row of the transition matrix $P$ the mass is essentially concentrated on few entries. Moreover,…
We investigate the conditions under which a moving condensate may exist in a driven mass transport system. Our paradigm is a minimal mass transport model in which $n-1$ particles move simultaneously from a site containing $n>1$ particles to…
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…
We study the hydrodynamic behaviour of the symmetric zero-range process on the finite interval $\{1, \ldots, N-1\}$ in contact with slow reservoirs at the boundary. Particles are injected and removed at sites $1$ and $N-1$ at rates that…
In this paper we study the metastability of the contact process on a random regular graph. We show that the extinction time of the contact process, when initialized so that all vertices are infected at time 0, grows exponentially with the…
The Zero-Range Process, in which particles hop between sites on a lattice under conserving dynamics, is a prototypical model for studying real-space condensation. Within this model the system is critical only at the transition point. Here…
In this article, we investigate the condensation phenomena for a class of nonreversible zero-range processes on a fixed finite set. By establishing a novel inequality bounding the capacity between two sets, and by developing a robust…
We study a zero range process on scale-free networks in order to investigate how network structure influences particle dynamics. The zero range process is defined with the particle jumping rate function $p(n)=n^\delta$. We show analytically…
Given a finite graph G, a vertex of the lamplighter graph consists of a zero-one labeling of the vertices of G, and a marked vertex of G. For transitive graphs G, we show that, up to constants, the relaxation time for simple random walk in…
We consider a zero-range process with two species of interacting particles. The steady state phase diagram of this model shows a variety of condensate phases in which a single site contains a finite fraction of all the particles in the…
We consider a general framework for multi-type interacting particle systems on graphs, where particles move one at a time by random walk steps, different types may have different speeds, and may interact, possibly randomly, when they meet.…
This article provides the first procedure for computing a fully data-dependent interval that traps the mixing time $t_{\text{mix}}$ of a finite reversible ergodic Markov chain at a prescribed confidence level. The interval is computed from…
The one-dimensional pair contact process with a particle source is studied by using dynamical cluster mean-field approximations with sites up to $n=12$. The results obtained for different levels of approximation become convergent especially…
We analyze a Markov chain, known as the product replacement chain, on the set of generating $n$-tuples of a fixed finite group $G$. We show that as $n \rightarrow \infty$, the total-variation mixing time of the chain has a cutoff at time…
We construct a family of growing finite bounded degree rooted graphs, $G_n$, in which the mixing time for simple random walk, starting at the root, is order $\log |G_n|$. Yet after a quasi - isometry, the ratio of $|G_n|$ over the mixing…
We analyse the mixing profile of a random walk on a dynamic random permutation, focusing on the regime where the walk evolves much faster than the permutation. Two types of dynamics generated by random transpositions are considered: one…
A mixing time density of $A + B \to 0$ on a finite one dimensional domain is defined for general initial and boundary conditions in which $A$ and $B$ diffuse at the same rate. The density is a measure of the number of $A$ and $B$ particles…
We investigate a zero-range process where the underlying one-particle stationary distribution has multifractality. The multiparticle stationary probability measure can be written in a factorized form. If the number of the particles is…
We study the convergence to equilibrium of the Dyson-Jacobi process, a system of n interacting particles on the segment [0, 1] arising from Random Matrix Theory. We establish the occurence of a cutoff phenomenon for the intrinsic…