Applications: Coupling

  • Russ Bubley
Part of the Distinguished Dissertations book series (DISTDISS)


In this chapter we consider three non-trivial applications of the coupling method to show rapid-mixing of certain Markov chains. In each case, the associated exact counting problem is #P-complete, but the approximate counting problem succumbs to the Markov chain Monte Carlo Lemma, once rapid-mixing of an appropriate Markov chain has been established.


Assure Rounded Verse 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag London Limited 2001

Authors and Affiliations

  • Russ Bubley
    • 1
  1. 1.University of LeedsLeedsUK

Personalised recommendations