Path coupling: A technique for proving rapid mixing in Markov chains

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1997, Pages 223-231

  Bubley, Russ ^a   Dyer, Martin ^a  

^a UNIVERSITY OF LEEDS   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONVERGENCE OF NUMERICAL METHODS; MARKOV PROCESSES; THEOREM PROVING;

PATH COUPLING;

COMBINATORIAL MATHEMATICS;

EID: 0031359702     PISSN: 02725428     EISSN: None     Source Type: None    
DOI: 10.1109/SFCS.1997.646111     Document Type: Conference Paper

References (17)

1. D. Aldous Séminaire de Probabilités XVII 1981/1982 986 243 297 1983 Springer-Verlag New York Random walks on finite groups and rapidly mixing Markov chains
2. N. Alon A. Frieze D. Welsh Polynomial time randomized approximation schemes for Tutte-Gröthendieck invariants: The dense case Random Structures and Algorithms 6 4 459 478 1995
3. C. Berge North-Holland Mathematical Library 6 428 447 1973 North-Holland Publishing Company AmsterdamLondon Graphs and Hypergraphs
4. R. Bubley M. E. Dyer Path coupling, Dobrushin uniqueness, and approximate counting January 1997 97.04 School of Computer Studies, University of Leeds
5. R. Bubley M. Dyer Graph orientations with no sink and an approximation for a hard case of #SAT Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms 248 257 Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms New Orleans Louisiana 1997-January-5-7
6. R. Bubley M. Dyer M. Jerrum A new approach to polynomial-time generation of random points in convex bodies April 1996 ECSLFCS-96-343 Department of Computer Science, University of Edinburgh
7. M. Dyer A. Frieze R. Kannan A random polynomial-time algorithm for approximating the volume of convex bodies Journal of the ACM 38 1 1 17 January 1991
8. M. Jerrum A very simple algorithm for estimating the number of k-colorings of a low-degree graph Random Structures and Algorithms 7 157 165 1995
9. M. Jerrum A. Sinclair Approximation Algorithms for NP-Hard Problems 482 520 1996 PWS Publishing Boston The Markov chain Monte Carlo method: an approach to approximate counting and integration
10. R. M. Karp M. Luby Monte-Carlo algorithms for enumeration and reliability problems 24th Annual Symposium on Foundations of Computer Science 56 64 24th Annual Symposium on Foundations of Computer Science Tucson Arizona 1983-November-7-9
11. M. Luby E. Vigoda Approximately counting up to four Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing 682 687 Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing El Paso Texas 1997-May-4-6
12. J. Salas A. D. Sokal Absence of phase transition for antiferromagnetic Potts models via the Dobrushin uniqueness theorem Journal of Statistical Physics 86 3— 4 551 579 February 1997
13. L. Tomescu Sur le problème du coloriage des graphes généralisés Comptes Rendus Hebdomadaires des Séances de l'Académie des Sciences Série A 267 6 250 252 5 August 1968
14. L. G. Valiant The complexity of enumeration and reliability problems SIAM Journal on Computing 8 3 410 421 August 1979