Abstract
We show that local dynamics require exponential time for two sampling problems motivated by statistical physics: independent sets on the triangular lattice (the hard-core lattice gas model) and weighted even orientations of the two-dimensional Cartesian lattice (the 8-vertex model). For each problem, there is a parameter λ known as the fugacity, such that local Markov chains are expected to be fast when λ is small and slow when λ is large. Unfortunately, establishing slow mixing for these models has been a challenge, as standard contour arguments typically used to show that a chain has small conductance do not seem to apply. We modify this approach by introducing the notion of fat contours that can have nontrivial area, and use these to establish slow mixing of local chains defined for these models.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aldous, D.: Random walks on finite groups and rapidly mixing Markov chains. In: Séminaire de Probabilités XVII. Springer Lecture Notes in Mathematics, vol. 986, pp. 243–297. Springer, Berlin (1981/82)
Borgs, C., Chayes, J.T., Frieze, A., Kim, J.H., Tetali, P., Vigoda, E., Vu, V.H.: Torpid mixing of some MCMC algorithms in statistical physics. In: Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, pp. 218–229 (1999)
Galvin, D., Kahn, J.: On phase transitions in the hard-core model on Z d. Comb. Probab. Comput. 13, 137–164 (2004)
Galvin, D., Randall, D.: Sampling 3-colorings of the discrete torus. In: Proceedings of the 17th ACM/SIAM Symposium on Discrete Algorithms, pp. 376–384 (2007)
Lawler, G.F., Sokal, A.D.: Bounds on the L2 spectrum for Markov chain and Markov processes: A generalization of Cheeger’s inequality. Trans. Am. Math. Soc. 309, 557–580 (1988)
Luby, M., Vigoda, E.: Fast convergence of the Glauber dynamics for sampling independent sets. Random Struct. Algorithms 15, 229–241 (1999)
Luby, M., Randall, D., Sinclair, A.J.: Markov chains for planar lattice structures. SIAM J. Comput. 31, 167–192 (2001)
Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., Teller, E.: Equation of state calculations by fast computing machines. J. Chem. Phys. 21, 1087–1092 (1953)
Randall, D.: Slow mixing of Glauber dynamics via topological obstructions. In: Proceedings of the 16th ACM/SIAM Symposium of Discrete Algorithms (SODA), pp. 870–879 (2006)
Randall, D., Tetali, P.: Analyzing Glauber dynamics by comparison of Markov chains. J. Math. Phys. 41, 1598–1615 (2000)
Sinclair, A., Jerrum, M.: Approximate counting, uniform generation and rapidly mixing Markov chains. Inf. Comput. 82, 93–133 (1989)
Thomas, L.E.: Bound on the mass gap for finite volume stochastic ising models at low temperature. Commun. Math. Phys. 126, 1–11 (1989)
Author information
Authors and Affiliations
Corresponding author
Additional information
A preliminary version of this paper appeared in the Proceedings of the 11th International Workshop on Randomization and Approximation Techniques in Computer Science in Lecture Notes in Computer Science 4627:540–553 (2007).
S. Greenberg and D. Randall supported in part by NSF grants CCR-0515105 and DMS-0505505.
Rights and permissions
About this article
Cite this article
Greenberg, S., Randall, D. Slow Mixing of Markov Chains Using Fault Lines and Fat Contours. Algorithmica 58, 911–927 (2010). https://doi.org/10.1007/s00453-008-9246-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-008-9246-3