相关论文: Hydrodynamic limit and cutoff for the biased adjac…
We consider dynamical percolation on the complete graph $K_n$, where each edge refreshes its state at rate $\mu \ll 1/n$, and is then declared open with probability $p = \lambda/n$ where $\lambda > 1$. We study a random walk on this…
The Markov dynamics of interlaced particle arrays, introduced by A. Borodin and P. Ferrari in arXiv:0811.0682, is a classical example of (2+1)-dimensional random growth model belonging to the so-called Anisotropic KPZ universality class. In…
In this article, we prove the cutoff phenomenon for a general class of the discrete-time nonlinear recombination models. This system models the evolution of a probability measure on a finite product space $S^n$ representing the state of…
We obtain the hydrodynamic limit of one-dimensional interacting particle systems describing the macroscopic evolution of the density of mass in infinite volume from the microscopic dynamics. The processes are weak pertubations of the…
A three-dimensional mathematical model of a viscous incompressible fluid with two stiff particles is investigated in the near-contact regime. When one of the particles approaches the other motionless particle with prescribed translational…
This article analyzes the formulation of space-time continuous hyperbolic hydrodynamic models for systems of interacting particles moving on a lattice, by connecting their local stochastic lattice dynamics to the formulation of an…
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…
Consider a system of particles performing nearest neighbor random walks on the lattice $\ZZ$ under hard--core interaction. The rate for a jump over a given bond is direction--independent and the inverse of the jump rates are i.i.d. random…
We study Brownian flows on manifolds for which the associated Markov process is strongly mixing with respect to an invariant probability measure and for which the distance process for each pair of trajectories is a diffusion $r$. We provide…
It is natural to expect that nonbacktracking random walk will mix faster than simple random walks, but so far this has only been proved in regular graphs. To analyze typical irregular graphs, let $G$ be a random graph on $n$ vertices with…
The paper deals with the asymptotic properties of a symmetric random walk in a high contrast periodic medium in $\mathbb Z^d$, $d\geq 1$. We show that under proper diffusive scaling the random walk exhibits a non-standard limit behaviour.…
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 study asymmetric zero-range processes on Z with nearest-neighbour jumps and site disorder. The jump rate of particles is an arbitrary but bounded nondecreasing function of the number of particles. For any given environment satisfying…
The irreducible decomposition of successive restriction and induction of irreducible representations of a symmetric group gives rise to a Markov chain on Young diagrams keeping the Plancherel measure invariant. Starting from this Res-Ind…
Consider $N$ particles performing random walks on the $\epsilon$-grid $(\epsilon Z)^d$, $\epsilon>0$ with branching and density-dependent selection: When one of the particles branches, a particle is removed from the most populated site. The…
We consider the superposition of symmetric simple exclusion dynamics speeded-up in time, with spin-flip dynamics in a one-dimensional interval with periodic boundary conditions. We show that the mixing time has an exponential lower bound in…
We study mixing times of the symmetric and asymmetric simple exclusion process on the segment where particles are allowed to enter and exit at the endpoints. We consider different regimes depending on the entering and exiting rates as well…
In this article, we consider the ABC model in contact with slow/fast reservoirs. In this model, there is at most one particle per site, which can be of type $\alpha\in\{A,B,C\}$ and particles exchange positions in the discrete set of points…
We prove a cutoff for the random walk on random $n$-lifts of finite weighted graphs, even when the random walk on the base graph $\mathcal{G}$ of the lift is not reversible. The mixing time is w.h.p. $t_{mix}=h^{-1}\log n$, where $h$ is a…
We consider an open interacting particle system on a finite lattice. The particles perform asymmetric simple exclusion and are randomly created or destroyed at all sites, with rates that grow rapidly near the boundaries. We study the…