Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag London Limited
About this chapter
Cite this chapter
Bubley, R. (2001). Applications: Coupling. In: Randomized Algorithms: Approximation, Generation and Counting. Distinguished Dissertations. Springer, London. https://doi.org/10.1007/978-1-4471-0695-1_4
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0695-1_4
Publisher Name: Springer, London
Print ISBN: 978-1-4471-1180-1
Online ISBN: 978-1-4471-0695-1
eBook Packages: Springer Book Archive