Mixing times for exclusion processes on hypergraphs

DOI10.1214/19-EJP332zbMath1467.60058arXiv1606.02703OpenAlexW2962763332MaRDI QIDQ2316597

Richard Pymar, Stephen B. Connor

Publication date: 6 August 2019

Published in: Electronic Journal of Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1606.02703

zbMATH Keywords

hypergraphrandom walkmixing timecouplingexclusioninterchange

Mathematics Subject Classification ID

Hypergraphs (05C65) Interacting particle systems in time-dependent statistical mechanics (82C22) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Continuous-time Markov processes on discrete state spaces (60J27)

Related Items (2)

The exclusion process mixes (almost) faster than independent particles ⋮ A sharp log-Sobolev inequality for the multislice

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mixing time and cutoff for the adjacent transposition shuffle and the simple exclusion
• The random \(k\) cycle walk on the symmetric group
• The mixing time for simple exclusion
• Random shuffles and group representations
• Cutoff for conjugacy-invariant random walks on the permutation group
• Rapidly mixing random walks and bounds on characters of the symmetric group
• Mixing of the symmetric exclusion processes in terms of the corresponding single-particle random walk
• Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems
• Hypergraph Coloring Games and Voter Models
• Proof of Aldous’ spectral gap conjecture
• Generating a random permutation with random transpositions

This page was built for publication: Mixing times for exclusion processes on hypergraphs