A general lower bound for mixing of single-site dynamics on graphs

Annals of Applied Probability

Volumn 17, Issue 3, 2007, Pages 931-952

  Hayes, Thomas P ^a,c   Sinclair, Alistair ^b,d  

^a TOYOTA TECHNOLOGICAL INSTITUTE   (Japan)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Fields; Glauber dynamics; Markov random; Mixing time; Spin systems

Indexed keywords

EID: 41949103233     PISSN: 10505164     EISSN: 10505164     Source Type: Journal    
DOI: 10.1214/105051607000000104     Document Type: Article

References (17)

1. ACHLIOPTAS, D., MOLLOY, M., MOORE, C. and VAN BUSSEL, F. (2004). Sampling grid colorings with fewer colors. LATIN 2004: Theoretical Informatics. Lecture Notes in Comput. Sci. 2976 80-89. Springer, Berlin. MR2095183
2. ALDOUS, D. (1983). Random walks on finite groups and rapidly mixing Markov chains. Séminaire de Probabilites XVII. Lecture Notes in Math. 986 243-297. Springer, Berlin. MR0770418
3. ALDOUS, D. and FILL, J. (2002). Reversible Markov chains and random walks on graphs. Unpublished manuscript. Available at www.stat.berkeley.edu/users/aldous/RWG/book.html. (References are to the September 10, 2002 version of Chapter 3.)
4. BESAG, J. (1974). Spatial interaction and the statistical analysis of lattice systems. J. Roy. Statist. Soc. Ser. B 36 192-236. MR0373208
5. BORGS, C., CHAYES, J. T., FRIEZE, A. M., KIM, J. H., TETALI, P., VIGODA, E. and VU, V. H. (1999). Torpid mixing of some Monte Carlo Markov chain algorithms from statistical physics. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science 218-229. IEEE Computer Soc., Los Alamitos, CA. MR1917562
6. DIACONIS, P. and SHAHSHAHANI, M. (1981). Generating a random permutation with random transpositions. Z. Wahrsch. Verw. Gebiete 57 159-179. MR0626813
7. DIACONIS, P. and SALOFF-COSTE, L. (1996). Logarithmic Sobolev inequalities for finite Markov chains. Ann. Appl. Probab. 6 695-750. MR/1410112
8. DYER, M., GOLDBERG, L. A., GREENHILL, C., JERRUM, M. and MITZENMACHER, M. (2001). An extension of path coupling and its application to the Glauber dynamics for graph colourings. SIAM J. Comput. 30 1962-1975. MR1856564
9. DYER, M., GOLDBERG, L. A. and JERRUM, M. (2006). Systematic scan for sampling colourings. Ann. Appl. Probab. 16 185-230. MR2209340
10. DYER, M., FRIEZE, A. M. and JERRUM, M. (2002). On counting independent sets in sparse graphs. SIAM J. Comput. 311527-1541. MR1936657
11. DYER, M., SINCLAIR, A., VIGODA, E. and WEITZ, D. (2004). Mixing in time and space for lattice spin systems: A combinatorial view. Random Structures Algorithms 24 461-479, MR2060631
12. GALVIN, D. and TETALI, P. (2006). Slow mixing of the Glauber dynamics for the hardcore model on regular bipartite graphs. Random Structures Algorithms 28 427-443. MR2225701
13. JERRUM, M. R. (1995). A very simple algorithm for estimating the number of k-colourings of a low-degree graph. Random Structures Algorithms 7 157-165. MR1369061
14. M.ARTINELLI, F. and OLIVIERI, E. (1994). Approach to equilibrium of Glauber dynamics in the one phase region. I. The attractive case. Comm. Math. Phys. 161 447-486. MR1269387
15. MOUSSOURIS, J. (1974). Gibbs and Markov random systems with constraints. J. Statist. Phys. 10 11-33. MR0432132
16. VIGODA, E. (2000). Improved bounds for sampling colorings. J. Math. Phys. 41 1555-1569. MR1757969
17. VIGODA, E. (2001). A note on the Glauber dynamics for sampling independent sets. Electron. J. Combin. 8. MR1814515