An exposition to information percolation for the Ising model

DOI10.5802/AFST.1462MaRDI QIDQ5963351zbMATH OpenOpenAlexFDO

Authors Eyal Lubetzky, Allan Sly

Publication date 19 February 2016

Published in Annales de la Faculté des Sciences de Toulouse. Mathématiques. Série VI (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1501.00128

zbMATH Keywords

Ising modelinformation percolationstochastic spin systems

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43) Time-dependent percolation in statistical mechanics (82C43)

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 $O(1)$-window) for the Ising model on $Z^d$ 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.

Recommendations

• Information percolation and cutoff for the stochastic Ising model
• Information percolation and cutoff for the random-cluster model
• Estimation of information theoretic measures on the Ising model
• Information geometry of finite Ising models
• Percolation and the Ising model
• scientific article; zbMATH DE number 6318810
• Critical scaling of the mutual information in two-dimensional disordered Ising models
• Mutual information of Ising systems
• Information percolation with equilibrium search dynamics
• Mean-field theory for percolation models of the Ising type

Cites work

• scientific article; zbMATH DE number 1418384 (Why is no real title available?)
• Cutoff for general spin systems with arbitrary boundary conditions
• Cutoff for the Ising model on the lattice
• Cutoff phenomena for random walks on random regular graphs
• Exact sampling with coupled Markov chains and applications to statistical mechanics
• Explicit expanders with cutoff phenomena
• Generating a random permutation with random transpositions
• Interacting particle systems. With a new postface.
• Shuffling Cards and Stopping Times
• The cutoff phenomenon in finite Markov chains.
• Uniformity of the uncovered set of random walk and cutoff for lamplighter chains

Cited in

(9)

• Universality of cutoff for exclusion with reservoirs
• Cutoff for the Swendsen-Wang dynamics on the lattice
• Cutoff for the non reversible SSEP with reservoirs
• scientific article; zbMATH DE number 6318810 (Why is no real title available?)
• Mutual information of Ising systems
• Fast initial conditions for Glauber dynamics
• Information percolation and cutoff for the stochastic Ising model
• Cutoff for the asymmetric riffle shuffle
• Cutoff for non-negatively curved Markov chains

This page was built for publication: An exposition to information percolation for the Ising model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963351)