English
Related papers

Related papers: The mixing time for simple exclusion

200 papers

We show that the decay of the density of active particles in the reaction $A+B \rightarrow 0$ in one dimension, with exclusion interaction, results in logarithmic corrections to the expected power law decay, when the starting initial…

Statistical Mechanics · Physics 2018-06-05 Rahul Dandekar

We study the mixing time of the $(n,k)$ Bernoulli--Laplace urn model, where $k\in\{0,1,\ldots,n\}$. Consider two urns, each containing $n$ balls, so that when combined they have precisely $n$ red balls and $n$ white balls. At each step of…

Probability · Mathematics 2020-02-25 Alexandros Eskenazis , Evita Nestoridi

Let $\mathcal{S}_n$ be the permutation group on $n$ elements, and consider a random walk on $\mathcal{S}_n$ whose step distribution is uniform on $k$-cycles. We prove a well-known conjecture that the mixing time of this process is…

Probability · Mathematics 2016-08-14 Nathanaël Berestycki , Oded Schramm , Ofer Zeitouni

By viewing the $N$-simplex as the set of positions of $N-1$ ordered particles on the unit interval, the adjacent walk is the continuous time Markov chain obtained by updating independently at rate 1 the position of each particle with a…

Probability · Mathematics 2020-11-16 Pietro Caputo , Cyril Labbé , Hubert Lacoin

We introduce quantum versions of the $\chi^2$-divergence, provide a detailed analysis of their properties, and apply them in the investigation of mixing times of quantum Markov processes. An approach similar to the one presented in [1-3]…

Quantum Physics · Physics 2024-04-08 K. Temme , M. J. Kastoryano , M. B. Ruskai , M. M. Wolf , F. Verstraete

We show a strict hierarchy among various edge and vertex expansion properties of Markov chains. This gives easy proofs of a range of bounds, both classical and new, on chi-square distance, spectral gap and mixing time. The 2-gradient is…

Probability · Mathematics 2009-04-03 Ravi Montenegro

The {\it matrix-chain multiplication} problem is a classic problem that is widely taught to illustrate dynamic programming. The textbook solution runs in $\theta(n^3)$ time. However, there is a complex $O(n \log n)$-time method \cite{HU82},…

Discrete Mathematics · Computer Science 2021-04-06 Thong Le , Dan Gusfield

The expulsion dynamics of the last liquid monolayer of molecules confined between two surfaces has been analyzed by solving the two-dimensional (2D) Navier-Stokes equation for a compressible liquid. We find that the squeeze-out is…

Materials Science · Physics 2007-05-23 U. Tartaglino , B. N. J. Persson , A. I. Volokitin , E. Tosatti

We study the asymptotic behavior for large N of the disconnection time T_N of simple random walk on a discrete cylinder with base a d-dimensional discrete torus of side-length N. When d is sufficiently large, we are able to substantially…

Probability · Mathematics 2008-07-28 Amir Dembo , Alain-Sol Sznitman

We investigate the time-asymptotic stability of the Jin-Xin model and its diffusive relaxation limit toward viscous conservation laws in $\mathbb{R}^d$ for $d\geq 1$. First, we establish a priori estimates that are uniform with respect to…

Analysis of PDEs · Mathematics 2025-07-10 Timothée Crin-Barat , Ling-Yun Shou , Jianzhong Zhang

The spectral gap $\gamma$ of a finite, ergodic, and reversible Markov chain is an important parameter measuring the asymptotic rate of convergence. In applications, the transition matrix $P$ may be unknown, yet one sample of the chain up to…

Statistics Theory · Mathematics 2017-08-25 Daniel Hsu , Aryeh Kontorovich , David A. Levin , Yuval Peres , Csaba Szepesvári

We present a simple analysis of k-means|| (Bahmani et al., PVLDB 2012) -- a distributed variant of the k-means++ algorithm (Arthur and Vassilvitskii, SODA 2007). Moreover, the bound on the number of rounds is improved from $O(\log n)$ to…

Data Structures and Algorithms · Computer Science 2020-07-03 Václav Rozhoň

We extend a technique for lower-bounding the mixing time of card-shuffling Markov chains, and use it to bound the mixing time of the Rudvalis Markov chain, as well as two variants considered by Diaconis and Saloff-Coste. We show that in…

Probability · Mathematics 2012-06-26 David Bruce Wilson

We define a new variant of exclusion processes in discrete time that has jump probabilities that depend on the last jump performed. In a particular limit for the jump probabilities and in suitable scaling limits for space and time, we…

Statistical Mechanics · Physics 2021-04-01 Bryan Debin , Etienne Granet

We study the mixing time of random walks on small-world networks modelled as follows: starting with the 2-dimensional periodic grid, each pair of vertices $\{u,v\}$ with distance $d>1$ is added as a "long-range" edge with probability…

Discrete Mathematics · Computer Science 2020-02-27 Martin E. Dyer , Andreas Galanis , Leslie Ann Goldberg , Mark Jerrum , Eric Vigoda

Understanding the mixing of open quantum systems is a fundamental problem in physics and quantum information science. Existing approaches for estimating the mixing time often rely on the spectral gap estimation of the Lindbladian generator,…

Quantum Physics · Physics 2025-04-14 Di Fang , Jianfeng Lu , Yu Tong

We revisit in this short article the hydrostatic limit for the exclusion process with slow boundary. The original proof of this result relies on estimates of the correlation functions. We achieve the same result based on analysis of two…

Probability · Mathematics 2019-04-30 Kenkichi Tsunoda

In this paper, we give a very accurate description of the way the simple exclusion process relaxes to equilibrium. Let $P_t$ denote the semi-group associated the exclusion on the circle with $2N$ sites and $N$ particles. For any initial…

Probability · Mathematics 2016-09-23 Hubert Lacoin

We study the stochastic 3D primitive equations of the atmospheric mechanics. We consider them under a bounded and non-degenerate noise, which is statistically periodic in time with period $1$. In such a case we prove that the associated…

Analysis of PDEs · Mathematics 2021-03-03 Pierre-Marie Boulvard

In this paper we consider the field of local times of a discrete-time Markov chain on a general state space, and obtain uniform (in time) upper bounds on the total variation distance between this field and the one of a sequence of $n$…

Probability · Mathematics 2019-03-25 Diego F. de Bernardini , Christophe Gallesco , Serguei Popov