Connor, S.B. and Pymar, Richard (2019) Mixing times for exclusion processes on hypergraphs. Electronic Journal of Probability 24 , p. 73. ISSN 1083-6489.
This is the latest version of this item.
![[img]](https://eprints.bbk.ac.uk/style/images/fileicons/text.png) |
Text
final_arxiv.pdf - Author's Accepted Manuscript Restricted to Repository staff only Download (800kB) |
|
|
Text
euclid.ejp.1561687606.pdf - Published Version of Record Available under License Creative Commons Attribution. Download (606kB) | Preview |
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 ε-mixing time of the exclusion process on G with any feasible number of particles can be upper-bounded by C TEX(2,G) log(|V|/ε), where |V| is the number of vertices in G and TEX(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 TEX(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 (2006) and developed by Oliveira (2013) for studying the exclusion process on a graph.
Metadata
| Item Type: | Article |
|---|---|
| Keyword(s) / Subject(s): | mixing time, exclusion, interchange, random walk, hypergraph coupling |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Richard Pymar |
| Date Deposited: | 10 Jul 2019 13:11 |
| Last Modified: | 09 Aug 2023 12:46 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/27960 |
Available Versions of this Item
- Mixing times for exclusion processes on hypergraphs. (deposited 10 Jul 2019 13:11) [Currently Displayed]
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
