Universality of cutoff for the Ising model
Eyal Lubetzky, Allan Sly

TL;DR
This paper proves that the Ising model exhibits cutoff at high enough temperatures across various geometries, with precise cutoff time and window, using a new information percolation framework.
Contribution
It introduces a new framework of information percolation to establish cutoff for the Ising model on any graph with bounded degree at sufficiently high temperatures, extending beyond lattices.
Findings
Cutoff occurs when $eta<rac{ ext{constant}}{d}$ for graphs with maximum degree $d$.
Cutoff location is when the sum of squared magnetizations drops to 1.
Cutoff window is of order 1, similar to the zero-temperature case.
Abstract
On any locally-finite geometry, the stochastic Ising model is known to be contractive when the inverse-temperature is small enough, via classical results of Dobrushin and of Holley in the 1970's. By a general principle proposed by Peres, the dynamics is then expected to exhibit cutoff. However, so far cutoff for the Ising model has been confirmed mainly for lattices, heavily relying on amenability and log Sobolev inequalities. Without these, cutoff was unknown at any fixed , no matter how small, even in basic examples such as the Ising model on a binary tree or a random regular graph. We use the new framework of information percolation to show that, in any geometry, there is cutoff for the Ising model at high enough temperatures. Precisely, on any sequence of graphs with maximum degree , the Ising model has cutoff provided that for some absolute…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMarkov Chains and Monte Carlo Methods · Theoretical and Computational Physics · Stochastic processes and statistical mechanics
