Path Coupling Using Stopping Times and Counting Independent Sets and Colourings in Hypergraphs

Magnus Bordewich, Martin Dyer, Marek Karpinski

We give a new method for analysing the mixing time of a Markov chain using path coupling with stopping times. We apply this approach to two hypergraph problems. We show that the Gl…