An exposition to information percolation for the Ising model
Eyal Lubetzky, Allan Sly

TL;DR
This paper introduces the information percolation method for analyzing the Ising model, demonstrating its effectiveness at high temperatures on lattices and transitive graphs, with implications for understanding mixing times and initial condition effects.
Contribution
It provides an expository demonstration of the information percolation technique applied to the Ising model at high temperatures, expanding its applicability to various graphs.
Findings
Sharp mixing estimates for the Ising model at high temperatures.
Demonstration of the method on lattices and transitive graphs.
Insights into the influence of initial conditions on mixing behavior.
Abstract
Information percolation is a new method for analyzing stochastic spin systems through classifying and controlling the clusters of information-flow in the space-time slab. It yielded sharp mixing estimates (cutoff with an -window) for the Ising model on up to the critical temperature, as well as results on the effect of initial conditions on mixing. In this expository note we demonstrate the method on lattices (more generally, on any locally-finite transitive graph) at very high temperatures.
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 · Complex Network Analysis Techniques · Theoretical and Computational Physics
