English
Related papers

Related papers: Cutoff for the mean-field zero-range process

200 papers

Let $(Z_n)$ be a supercritical branching process in an independent and identically distributed random environment $\xi$. We study the asymptotic of the harmonic moments $\mathbb{E}\left[Z_n^{-r} | Z_0=k \right]$ of order $r>0$ as $n \to…

Probability · Mathematics 2016-08-30 Ion Grama , Quansheng Liu , Eric Miqueu

We study the Glauber dynamics for the Ising model on the complete graph, also known as the Curie-Weiss Model. For beta < 1, we prove that the dynamics exhibits a cut-off: the distance to stationarity drops from near 1 to near 0 in a window…

Probability · Mathematics 2007-12-11 David A. Levin , Malwina J. Luczak , Yuval Peres

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. We prove quenched strong local…

Probability · Mathematics 2018-04-18 Christophe Bahadoran , T. Mountford , K. Ravishankar , E Saada

In this note, we demonstrate an instance of bounded-degree graphs of size $n$, for which the total variation mixing time for the random walk is decreased by a factor of $\log n/ \log\log n$ if we multiply the edge-conductances by bounded…

Probability · Mathematics 2013-04-02 Jian Ding , Yuval Peres

This paper summarises a numerical investigation of phase mixing in time-independent Hamiltonian systems that admit a coexistence of regular and chaotic phase space regions, allowing also for low amplitude perturbations idealised as periodic…

Astrophysics · Physics 2007-05-23 Henry E. Kandrup , Steven J. Novotny

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…

Probability · Mathematics 2021-02-03 Sam Olesker-Taylor , Perla Sousi

We discuss statics and dynamics of condensation in a zero-range process with compartments of limited sizes. For the symmetric dynamics the stationary state has a factorized form. For the asymmetric dynamics the steady state factorizes only…

Statistical Mechanics · Physics 2014-02-25 Artem Ryabov

We present an upper bound on the mixing rate of the equilibrium state of a dynamical systems defined by the one-sided shift and a non H\"{o}lder potential of summable variations. The bound follows from an estimation of the relaxation speed…

Probability · Mathematics 2016-09-07 Xavier Bressaud , Roberto Fernández , Antonio Galves

Continuously monitoring the environment of a quantum many-body system reduces the entropy of (purifies) the reduced density matrix of the system, conditional on the outcomes of the measurements. We show that, for mixed initial states, a…

Quantum Physics · Physics 2020-11-03 Michael J. Gullans , David A. Huse

We prove phase-space mixing for solutions to Liouville's equation for integrable systems. Under a natural non-harmonicity condition, we obtain weak convergence of the distribution function with rate $\langle \mathrm{time} \rangle^{-1}$. In…

Mathematical Physics · Physics 2022-07-13 Matías Moreno , Paola Rioseco , Hanne Van Den Bosch

The theory of rapid mixing random walks plays a fundamental role in the study of modern randomised algorithms. Usually, the mixing time is measured with respect to the worst initial position. It is well known that the presence of…

Probability · Mathematics 2024-01-30 Alberto Espuny Díaz , Patrick Morris , Guillem Perarnau , Oriol Serra

We studied metastability and extinction time of a finite system with a large number of interacting components in discrete time by means of analytical and numerical investigation. The system is markovian with respect to the potential profile…

Adaptation and Self-Organizing Systems · Physics 2018-12-27 L. Brochini , M. Abadi

It is well-known that 0 is the absorbing state for a branching system. Each particle in the system lives a random long time and gives a random number of new particles at its death time. It stops when the system has no particle. This paper…

Probability · Mathematics 2022-10-31 Yanyun Li , Junping Li

Recent studies of melting in hard disks have confirmed the existence of a hexatic phase occurring in a narrow window of density which is separated from the isotropic liquid phase by a first-order transition, and from the solid phase by a…

Statistical Mechanics · Physics 2017-09-20 John Russo , Nigel B. Wilding

We present a Markov chain example where non-reversibility and an added edge jointly improve mixing time: when a random edge is added to a cycle of $n$ vertices and a Markov chain with a drift is introduced, we get mixing time of…

Probability · Mathematics 2019-06-07 Balázs Gerencsér

A model is proposed that describes the evolution of a mixed state of a quantum system for which gain and loss of energy or amplitude are present. Properties of the model are worked out in detail. In particular, invariant subspaces of the…

Quantum Physics · Physics 2012-12-06 Dorje C. Brody , Eva-Maria Graefe

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…

Statistical Mechanics · Physics 2025-09-19 Gunter Schutz , Ali Zahra

We study random walks on the giant component of the Erd\H{o}s-R\'enyi random graph ${\cal G}(n,p)$ where $p=\lambda/n$ for $\lambda>1$ fixed. The mixing time from a worst starting point was shown by Fountoulakis and Reed, and independently…

Probability · Mathematics 2016-10-21 Nathanael Berestycki , Eyal Lubetzky , Yuval Peres , Allan Sly

In this work we investigate symmetry breaking in the presence of a turbulent environment. The transition from a symmetric state to a symmetry-breaking state is demonstrated using two examples: (i) the transition of a two-dimensional flow to…

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…

Probability · Mathematics 2018-05-07 Anna Ben-Hamou , Eyal Lubetzky , Yuval Peres