Slow mixing of glauber dynamics via topological obstructions

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 870-879

  Randall, Dana ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRITICAL POINT; EXPONENTIAL TIME; GLAUBER DYNAMICS; POLYNOMIAL TIME;

CRYSTAL LATTICES; DYNAMICS; PARAMETER ESTIMATION; PHASE TRANSITIONS; POLYNOMIALS;

MARKOV PROCESSES;

EID: 33244457610     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109653     Document Type: Conference Paper

References (16)

1. R.J. Baxter, I.G. Entig, and S.K. Tsang. Hard-square lattice gas. Journal of Statistical Physics, 22: 465-489, 1989.
2. J. van den Berg and J.E. Steif. Percolation and the hard-core lattice model. Stochastic Processes and their Applications, 49: 179-197, 1994.
3. C. Borgs. Polymers, contours and their applications in discrete mathematics. Monograph in preparation, 2004.
4. C. Borgs, J.T. Chayes, A. Frieze, J.H. Kim, P. Tetali, E. Vigoda, and V.H. Vu. Torpid mixing of some MCMC algorithms in statistical physics. Proc. 40th IEEE Symp. on Foundations of Computer Science, 218-229, 1999.
5. R.L. Dobrushin. The problem of uniqueness of a Gibbsian random field and the problem of phase transitions. Functional Analysis and its Applications, 2: 302-312, 1968.
6. R.L. Dobrushin and S.B. Shlosman. Constructive criterion for the uniqueness of Gibbs fields. In Statistical physics and dynamical systems, vol. 10 of Progress in Physics, 347-370, Birhauser, Boston, 1985.
7. D. Galvin. Personal communication, 2004.
8. d. To appear in Combinatorics, Probability and Computing.
9. R. Glauber. Time dependent statistics of the Ising model. Journal of Mathematical Physics 4: 294-307, 1963.
10. R. Kannan, M.W. Mahoney, and R. Montenegro. Rapid mixing of several Markov chains for a hard-core model. 14th Annual ISAAC, 663-675, 2003.
11. M. Luby and E. Vigoda. Fast convergence of the Glauber dynamics for sampling independent sets. Random Structures and Algorithms, 229-241, 1999.
12. N. Madras and G. Slade. The Self-Avoiding Walk. Birkhäuser, Boston, 1993.
13. N. Metropolis, A. W. Rosenbluth, M.N. Rosenbluth, A.H. Teller, E. Teller. Equation of state calculations by fast computing machines. Journal of Chemical Physics, 21: 1087-1092, 1953.
14. d. Electronic Journal of Combinatorics, 7, 2000.
15. A.J. Sinclair and M.R. Jerrum. Approximate counting, uniform generation and rapidly mixing Markov chains Information and Computation 82:93-133, 1989.
16. P. Tetali. Personal communication, 2004.