Abstract
Glauber dynamics on spin systems are well known to suffer exponential slowdowns at low temperatures due to the emergence of multiple metastable phases, separated by narrow bottlenecks that are hard for the dynamics to cross. It is a folklore belief that if the dynamics is initialized from an appropriate random mixture of ground states, one for each phase, then convergence to the Gibbs distribution should be much faster. However, such phenomena have largely evaded rigorous analysis, as most tools in the study of Markov chain mixing times are tailored to worst-case initializations. In this paper we develop a general framework towards establishing this conjectured behavior for the Ising model. In the classical setting of the Ising model on an N-vertex torus in g.,Currency signd, our framework implies that the mixing time for the Glauber dynamics, initialized from a 1/2-1/2 mixture of the all-plus and all-minus configurations, is N1+o(1) in dimension d=2, and at most quasi-polynomial in all dimensions d≥ 3, at all temperatures below the critical one. The key innovation in our analysis is the introduction of the notion of "weak spatial mixing within a phase", a low-temperature adaptation of the classical concept of weak spatial mixing. We show both that this new notion is strong enough to control the mixing time from the above random initialization (by relating it to the mixing time with plus boundary condition at O(logN) scales), and that it holds at all low temperatures in all dimensions. This framework naturally extends to more general families of graphs. To illustrate this, we use the same approach to establish optimal O(NlogN) mixing for the Ising Glauber dynamics on random regular graphs at sufficiently low temperatures, when initialized from the same random mixture.
Original language | English (US) |
---|---|
Title of host publication | STOC 2022 - Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing |
Editors | Stefano Leonardi, Anupam Gupta |
Publisher | Association for Computing Machinery |
Pages | 1445-1458 |
Number of pages | 14 |
ISBN (Electronic) | 9781450392648 |
DOIs | |
State | Published - Sep 6 2022 |
Event | 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2022 - Rome, Italy Duration: Jun 20 2022 → Jun 24 2022 |
Publication series
Name | Proceedings of the Annual ACM Symposium on Theory of Computing |
---|---|
ISSN (Print) | 0737-8017 |
Conference
Conference | 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2022 |
---|---|
Country/Territory | Italy |
City | Rome |
Period | 6/20/22 → 6/24/22 |
Funding
The authors are grateful to Allan Sly for pointing out an error in the proof of an earlier version of Theorem 1.1. The authors also thank Fabio Martinelli and Allan Sly for useful discussions. R.G. thanks the Miller Institute for Basic Research in Science for its support. The research of A.S. is supported in part by NSF grant CCF-1815328. Part of this work was done while A.S. was visiting EPFL, Switzerland.
Keywords
- Ising model
- Markov chains
- metastability
- mixing time
ASJC Scopus subject areas
- Software