Path Coupling Using Stopping Times

Abstract. We analyse the mixing time of Markov chains using path coupling with stopping times. We apply this approach to two hypergraph problems. We show that the Glauber dynamics for independent sets in a hypergraph mixes rapidly as long as the maximum degree ∆ of a vertex

• Type: Conference
• Year: 2005
• Where: FCT
• Authors: Magnus Bordewich, Martin E. Dyer, Marek Karpinski
• Keywords: FCT 2005, Hypergraph Mixes, Hypergraph Problems, Markov Chains