Skip to main navigation Skip to search Skip to main content

Variable Length Path Coupling

  • The University of Chicago

Research output: Contribution to conferencePaperpeer-review

9 Scopus citations

Abstract

We present a new technique for constructing and analyzing couplings to bound the convergence rate of finite Markov chains. Our main theorem is a generalization of the path coupling theorem of Bubley and Dyer, allowing the defining partial couplings to have length determined by a random stopping time. Unlike the original path coupling theorem, our version can produce multi-step (non-Markovian) couplings. Using our variable length path coupling theorem, we improve the upper bound on the mixing time of the Glauber dynamics for randomly sampling colorings.

Original languageEnglish
Pages96-103
Number of pages8
StatePublished - 2004
EventProceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms - New Orleans, LA., United States
Duration: Jan 11 2004Jan 13 2004

Conference

ConferenceProceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms
Country/TerritoryUnited States
CityNew Orleans, LA.
Period01/11/0401/13/04

Fingerprint

Dive into the research topics of 'Variable Length Path Coupling'. Together they form a unique fingerprint.

Cite this