Analyzing Glauber dynamics by comparison of Markov chains

Journal of Mathematical Physics

Volumn 41, Issue 3, 2000, Pages 1598-1615

  Randall, Dana ^a   Tetali, Prasad ^b  

^a Georgia Institute of Technology   (United States)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034345469     PISSN: 00222488     EISSN: None     Source Type: Journal    
DOI: 10.1063/1.533199     Document Type: Review

References (38)

1. M. Jerrum, "Mathematical Foundations of the Markov Chain Monte Carlo Method," in Probabilistic Methods for Algorithmic Discrete Mathematics, edited by Habib et al. (Springer-Verlag, New York, 1998), pp. 116-165.
2. R. Kannan, "Markov chains and polynomial time algorithms," Proceedings 35th IEEE Symposium on Foundations of Computer Science (1994), pp. 656-671.
3. D. J. A. Welsh, "Approximate counting," in Surveys in Combinatorics, edited by R. A. Bailey (Cambridge U. P. Cambridge, 1997); London Math Society Lecture Notes 241, 287-317 (1997).
4. A. J. Sinclair and M. R. Jerrum, "Approximate counting, uniform generation and rapidly mixing Markov chains," Information and Computation 82, 93-133 (1989).
5. M. R. Jerrum and A. J. Sinclair, "Approximating the permanent," SIAM J. Comput. 18, 1149-1178 (1989).
6. C. Kenyon, D. Randall, and A. Sinclair, "Approximating the number of dimer coverings of a lattice," Stat. Phys. 83, 637-659 (1996).
7. M. R. Jerrum and A. J. Sinclair, "Polynomial-time approximation algorithms for the Ising model," SIAM J. Comput. 22, 1087-1116 (1993).
8. D. Aldous, "Random walks on finite groups and rapidly mixing Markov chains," in Séminaire de Probabilités XVII, 1981/82, Springer Lecture Notes in Mathematics, Vol. 986, pp. 243-297.
9. 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).
10. E. Vigoda, "Improved bounds for sampling colorings," Proceedings of the 40th IEEE Symposium on Foundation of Computer Science (1999), New York, NY.
11. M. Luby and E. Vigoda, "Approximately counting up to four," Proceedings 29th ACM Symposium on Theory of Computing (1997), pp. 150-159.
12. M. Luby, D. Randall, and A. Sinclair, "Markov Chain Algorithms for Planar Lattice Structures," Proceedings of the 36th IEEE Symposium on Foundations of Computing (1995), pp. 150-159.
13. R. Bubley and M. Dyer, "Path coupling: A technique for proving rapid mixing in Markov chains," Proceedings of the 38th IEEE Symposium on Foundations of Computer Science (1997).
14. R. Kannan, P. Tetali, and S. Vempala, "Simple Markov chain algorithms for generating bipartite graphs and tournaments," Proceedings of the 8th ACM-SIAM Symposium on Discrete Algorithms (January 1997).
15. L. McShine and P. Tetali, "On the mixing time of the triangulation walk and other Catalan structures," Randomization Methods in Algorithm Design, DIMACS-AMS Vol. 43 (1998), pp. 147-160.
16. M. Dyer and C. Greenhill, "On Markov chains for independent sets," J. of Algorithms (to appear).
17. D. Randall and P. Tetali, "Analyzing Glauber dynamics by comparisons of Markov chains," Proceedings 3rd Latin American Theoretical Informatics Symposium, Springer Lecture Notes in Computer Science (1998), Vol. 1380, pp. 292-304.
18. P. Diaconis and L. Saloff-Coste, "Comparison theorems for reversible Markov chains," Ann. Appl. Probability 3, 696-730 (1993).
19. P. Diaconis and D. Stroock, "Geometric bounds for eigenvalues of Markov chains," Ann. Appl. Probability 1, 36-61 (1991).
20. R. Holley, "Possible rates of convergence in finite range, attractive spin systems," in Particle Systems, Random Media, and Large Deviations, Contemp. Math. 41, 215-234 (1985).
21. P. Diaconis and L. Saloff-Coste, "Logarithmic Sobolev inequalities for finite Markov chains," Ann. Appl. Probab. 6, 695-750 (1996).
22. F. Martinelli, "Lectures on Glauber dynamics for discrete spin models," preprint (1997).
23. J. van den Berg and R. Brouwer, "Random sampling for the monomer-dimer model on a lattice," J. Math. Phys. 41, 1585-1597 (2000).
24. N. Madras and D. Randall, "Factoring Markov chains to bound mixing rates," Proceedings 37th IEEE Symposium on Foundations of Computing (1996).
25. N. Madras and D. Randall, "Decomposing Markov chains," preprint (1999).
26. A. J. Sinclair, Algorithms for Random Generation & Counting: A Markov Chain Approach (Birkhäuser, Boston, 1993), pp. 47-48.
27. D. B. Wilson, "Mixing times of lozenge tiling and card shuffling Markov chains," preprint (1997).
28. W. Thurston, "Conway's tiling group," Am. Math. Monthly 97, 757-773 (1990).
29. R. Stanley, Enumerative Combinatorics, Volume II (Cambridge University Press, Cambridge, 1999).
30. D. Sleator, R. Tarjan, and W. Thurston, "Rotation distance, triangulations, and hyperbolic geometry," J. Am. Math. Soc. 1, (1988).
31. C. Kenyon and W. Thurston, "Rotation distance using flows," preprint (1992).
32. M. Molloy, B. Reed, and W Steiger, "On the mixing rate of the triangulation walk" (Ref. 15), pp. 179-190.
33. D. Griffeath, "The basic contact processes," Stochastic Proc. Appl 11, 151-185 (1981).
34. L. Saloff-Coste, "Lectures on finite Markov chains," Lecture Notes in Math. 1665, 301-413 (1997).
35. S. Miclo, Lect. Notes Math. 1655, 136-167 (1995).
36. P. Diaconis and M. Shashahani, "Generating a random permutation with random transpositions," Z. Wahrscheinlichkeitstheor. Verwandte Geb. 57, 159-179 (1981).
37. P. Diaconis and L. Saloff-Coste, "Comparison techniques for random walks on finite groups," Ann. Prob. 21, 2131-2156 (1993).
38. M. Luby and E. Vigoda, "Fast convergence of the Glauber dynamics for sampling independent sets," Random Structures and Algorithms 15, 229-241 (1999).