An exposition to information percolation for the Ising model

DOI10.5802/AFST.1462zbMATH Open1333.60207arXiv1501.00128OpenAlexW2963793591MaRDI QIDQ5963351FDOQ5963351

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)

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.

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

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

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)

Cites Work

• Shuffling Cards and Stopping Times
• Generating a random permutation with random transpositions
• Interacting particle systems. With a new postface.
• The cutoff phenomenon in finite Markov chains.
• Cutoff for the Ising model on the lattice
• Exact sampling with coupled Markov chains and applications to statistical mechanics
• Title not available (Why is that?)
• Explicit expanders with cutoff phenomena
• Cutoff phenomena for random walks on random regular graphs
• Uniformity of the uncovered set of random walk and cutoff for lamplighter chains
• Cutoff for General Spin Systems with Arbitrary Boundary Conditions

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
• Title not available (Why is that?)
• 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)