• Corpus ID: 226221999

Cutoffs for exclusion and interchange processes on finite graphs

@article{Chen2020CutoffsFE,
  title={Cutoffs for exclusion and interchange processes on finite graphs},
  author={Joe P. J. Chen and R. Marinho},
  journal={arXiv: Probability},
  year={2020}
}
We prove a general theorem on cutoffs for symmetric exclusion and interchange processes on finite graphs $G_N=(V_N,E_N)$, under the assumption that either the graphs converge geometrically and spectrally to a compact metric measure space, or they are isomorphic to discrete Boolean hypercubes. Specifically, cutoffs occur at times $\displaystyle t_N= (2\gamma_1^N)^{-1}\log |V_N|$, where $\gamma_1^N$ is the spectral gap of the symmetric random walk process on $G_N$. Under the former assumption… 
1 Citations

Figures from this paper

Cutoffs for exclusion processes on graphs with open boundaries
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

References

SHOWING 1-10 OF 29 REFERENCES
The exclusion process mixes (almost) faster than independent particles
Oliveira conjectured that the order of the mixing time of the exclusion process with $k$-particles on an arbitrary $n$-vertex graph is at most that of the mixing-time of $k$ independent particles. We
Random Walks on Finite Groups
TLDR
This article gives a general overview of Markov chains on finite sets, and how the structure of a particular class of groups relates to the mixing time of natural random walks on those groups.
Mixing of the symmetric exclusion processes in terms of the corresponding single-particle random walk
We prove an upper bound for the e-mixing time of the symmetric exclusion process on any graph G, with any feasible number of particles. Our estimate is proportional to TRW(G)ln(|V|/e), where |V| is
Mixing time and cutoff for the adjacent transposition shuffle and the simple exclusion
In this paper, we investigate the mixing time of the adjacent transposition shuffle for a deck of cards. We prove that around time N^2\log N/(2\pi^2), the total-variation distance to equilibrium of
Proof of Aldous' spectral gap conjecture
Aldous' spectral gap conjecture asserts that on any graph the random walk process and the random transposition (or interchange) process have the same spectral gap. We prove the conjecture using a
The Simple Exclusion Process on the Circle has a diffusive Cutoff Window
In this paper, we investigate the mixing time of the simple exclusion process on the circle with $N$ sites, with a number of particle $k(N)$ tending to infinity, both from the worst initial condition
Mixing times of lozenge tiling and card shuffling Markov chains
We show how to combine Fourier analysis with coupling arguments to bound the mixing times of a variety of Markov chains. The mixing time is the number of steps a Markov chain takes to approach its
A strong uniform time for random transpositions
A random permutation ofN items generated by a sequence ofK random transpositions is considered. The method of strong uniform times is used to give an upper bound on the variation distance between the
The Cutoff profile for the Simple-Exclusion process on the circle
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$
Scaling Limits of Interacting Particle Systems
1. An Introductory Example: Independent Random Walks.- 2. Some Interacting Particle Systems.- 3. Weak Formulations of Local Equilibrium.- 4. Hydrodynamic Equation of Symmetric Simple Exclusion
...
1
2
3
...