37 citations · 39 across the 2 of their papers we have counts for
Showing math.PRShow all
2 papers · 1 filter
math.PR2005★ 2 cited
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…
math.PR2004★ 37 cited
Markov chain comparison
Martin Dyer, Leslie Ann Goldberg, Mark Jerrum +1
This is an expository paper, focussing on the following scenario. We have two Markov chains, and . By some means, we have obtained a bound on the mixi…