Fast and Slow Mixing of the Kawasaki Dynamics on Bounded-Degree Graphs

Abstract

We study the worst-case mixing time of the global Kawasaki dynamics for the fixed-magnetization Ising model on the class of graphs of maximum degree $\Delta$. Proving a conjecture of Carlson, Davies, Kolla, and Perkins, we show that below the tree uniqueness threshold, the Kawasaki dynamics mix rapidly for all magnetizations. Disproving a conjecture of Carlson, Davies, Kolla, and Perkins, we show that the regime of fast mixing does not extend throughout the regime of tractability for this model: there is a range of parameters for which there exist efficient sampling algorithms for the fixed-magnetization Ising model on max-degree $\Delta$ graphs, but the Kawasaki dynamics can take exponential time to mix. Our techniques involve showing spectral independence in the fixed-magnetization Ising model and proving a sharp threshold for the existence of multiple metastable states in the Ising model with external field on random regular graphs.

arXiv comment51 pages, 5 figures; v2: incorporated referee comments, final published version

References in corpus (6)

• Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models
• Exact thresholds for Ising-Gibbs samplers on general graphs
• Metastability of the Potts ferromagnet on random regular graphs
• Stochastic dynamics and the Polchinski equation: an introduction
• Kawasaki dynamics beyond the uniqueness threshold
• Absence of zeros implies strong spatial mixing