{"paper":{"title":"Mixing times for exclusion processes on hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Richard Pymar, Stephen B. Connor","submitted_at":"2016-06-08T19:52:12Z","abstract_excerpt":"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 i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02703","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}