Mixing times for exclusion processes on hypergraphs

@inproceedings{Connor2016MixingTF,
  title={Mixing times for exclusion processes on hypergraphs},
  author={Stephen B. Connor and Richard Pymar},
  year={2016}
}
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 CTEX(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… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Similar Papers

Loading similar papers…