Electronic Journal of Probability

Mixing times for exclusion processes on hypergraphs

Abstract

We introduce a natural extension of the exclusion process to hypergraphs and prove an upper bound for its mixing time. In particular we show the existence of a constant $C$ such that for any connected, regular hypergraph $G$ within some natural class, the $\varepsilon$-mixing time of the exclusion process on $G$ with any feasible number of particles can be upper-bounded by $CT_{\text{EX} (2,G)}\log (|V|/\varepsilon )$, where $|V|$ is the number of vertices in $G$ and $T_{\text{EX} (2,G)}$ is the 1/4-mixing time of the corresponding exclusion process with just two particles. Moreover we show this is optimal in the sense that there exist hypergraphs in the same class for which $T_{\mathrm{EX} (2,G)}$ and the mixing time of just one particle are not comparable. The proofs involve an adaptation of the chameleon process, a technical tool invented by Morris ([14]) and developed by Oliveira ([15]) for studying the exclusion process on a graph.

Article information

Source
Electron. J. Probab., Volume 24 (2019), paper no. 73, 48 pp.

Dates
Accepted: 9 June 2019
First available in Project Euclid: 28 June 2019

https://projecteuclid.org/euclid.ejp/1561687606

Digital Object Identifier
doi:10.1214/19-EJP332

Citation

Connor, Stephen B.; Pymar, Richard J. Mixing times for exclusion processes on hypergraphs. Electron. J. Probab. 24 (2019), paper no. 73, 48 pp. doi:10.1214/19-EJP332. https://projecteuclid.org/euclid.ejp/1561687606

References

• [1] David Aldous and James Allen Fill, Reversible Markov Chains and Random Walks on Graphs (2002), Unfinished monograph, recompiled 2014, available at http://www.stat.berkeley.edu/~aldous/RWG/book.html.
• [2] N Berestycki and B Sengul, Cutoff for conjugacy-invariant random walks on the permutation group, Probab. Theor. Rel. Fields 173 (2019), no. 3–4, 1197–1241.
• [3] Pietro Caputo, Thomas M. Liggett, and Thomas Richthammer, Proof of Aldous’ spectral gap conjecture, J. Amer. Math. Soc. 23 (2010), no. 3, 831–851.
• [4] Fan Chung and Alexander Tsiatas, Hypergraph coloring games and voter models, Internet Math. 10 (2014), no. 1–2, 66–86.
• [5] Persi Diaconis and Mehrdad Shahshahani, Generating a random permutation with random transpositions, Z. Wahrsch. Verw. Gebiete 57 (1981), no. 2, 159–179.
• [6] L. Flatto, A. M. Odlyzko, and D. B. Wales, Random shuffles and group representations, Ann. Probab. 13 (1985), no. 1, 154–178.
• [7] Bob Hough, The random $k$ cycle walk on the symmetric group, Probab. Theor. Rel. Fields 165 (2016), no. 1–2, 447—482.
• [8] Gabriel Istrate, Cosmin Bonchis, and Mircea Marin, Interactive particle systems and random walks on hypergraphs (2014).
• [9] Hubert Lacoin, Mixing time and cutoff for the adjacent transposition shuffle and the simple exclusion, Ann. Probab. 44 (2016), no. 2, 1426–1487.
• [10] David A Levin, Yuval Peres, and Elizabeth L Wilmer, Markov Chains and Mixing Times, American Mathematical Society, Providence, RI (2009).
• [11] Thomas M. Liggett, Interacting particle systems, Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], vol. 276, Springer-Verlag, New York, 1985.
• [12] Thomas M. Liggett, Stochastic interacting systems: contact, voter and exclusion processes, Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], vol. 324, Springer-Verlag, Berlin, 1999.
• [13] Nathan Lulov and Igor Pak, Rapidly mixing random walks and bounds on characters of the symmetric group, J. Algebraic Combin. 16 (2002), no. 2, 151–163.
• [14] Ben Morris, The mixing time for simple exclusion, Ann. App. Probab. 16 (2006), no. 2, 615–635.
• [15] Roberto Imbuzeiro Oliveira, Mixing of the symmetric exclusion processes in terms of the corresponding single-particle random walk, Ann. Probab. 41 (2013), no. 2, 871–913.