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.
KeywordsMarkov Chain Random Walk Convex Body Satisfying Assignment Trial Step
Unable to display preview. Download preview PDF.