An exposition to information percolation for the Ising model

@article{Lubetzky2014AnET,
  title={An exposition to information percolation for the Ising model},
  author={Eyal Lubetzky and Allan Sly},
  journal={arXiv: Probability},
  year={2014}
}
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… 
The coupling time for the Ising heat-bath dynamics & efficient optimization for statistical inference
In this thesis we consider two separate topics of study. The first topic concerns the Ising heat-bath Glaubers dynamics. These dynamics describe a continuous time Markov chain, whose states are
Fast initial conditions for Glauber dynamics
In the study of Markov chain mixing times, analysis has centered on the performance from a worst-case starting state. Here, in the context of Glauber dynamics for the one-dimensional Ising model, we
Information percolation and cutoff for the random-cluster model
TLDR
This proof proves that for all small enough $p$ (depending on the dimension) and any $q>1$, the FK-dynamics exhibits the cutoff phenomenon at $\lambda_{\infty}^{-1}\log n$ with a window size $O(\log\log n)$.
Cutoff for the Swendsen–Wang dynamics on the lattice
We study the Swendsen-Wang dynamics for the $q$-state Potts model on the lattice. Introduced as an alternative algorithm of the classical single-site Glauber dynamics, the Swendsen-Wang dynamics is a
Community detection on euclidean random graphs
  • Abishek Sankararaman, F. Baccelli
  • Mathematics, Computer Science
    2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
  • 2017
TLDR
A new class of sparse spatial random graphs, seen as ‘planted-partition’ versions of the classical random connection graphs studied in Stochastic Geometry, is introduced and it is shown that if the intensity λ is sufficiently small, then there exists no algorithm that beats a random guess for the partition.
Universality of cutoff for exclusion with reservoirs
We consider the reversible exclusion process with reservoirs on arbitrary networks. We explicitly characterize the relaxation time, mixing time, and mixing window of the process, in terms of certain
Cutoff for non-negatively curved Markov chains
Discovered by Aldous, Diaconis and Shahshahani in the context of card shuffling, the cutoff phenomenon has since then been established for a variety of Markov chains. However, proving cutoff remains

References

SHOWING 1-10 OF 24 REFERENCES
Information percolation and cutoff for the stochastic Ising model
We introduce a new framework for analyzing Glauber dynamics for the Ising model. The traditional approach for obtaining sharp mixing results has been to appeal to estimates on spatial properties of
Cutoff for the Ising model on the lattice
Introduced in 1963, Glauber dynamics is one of the most practiced and extensively studied methods for sampling the Ising model on lattices. It is well known that at high temperatures, the time it
Universality of cutoff for the ising model
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 1970s.
Lectures on Glauber dynamics for discrete spin models
These notes have been the subject of a course I gave in the summer 1997 for the school in probability theory in Saint-Flour. I review in a self-contained way the state of the art, sometimes providing
Cutoff phenomena for random walks on random regular graphs
The cutoff phenomenon describes a sharp transition in the convergence of a family of ergodic finite Markov chains to equilibrium. Many natural families of chains are believed to exhibit cutoff, and
Cutoff for General Spin Systems with Arbitrary Boundary Conditions
The cutoff phenomenon describes a sharp transition in the convergence of a Markov chain to equilibrium. In recent work, the authors established cutoff and its location for the stochastic Ising model
The cutoff phenomenon in finite Markov chains.
  • P. Diaconis
  • Mathematics, Medicine
    Proceedings of the National Academy of Sciences of the United States of America
  • 1996
TLDR
This paper presents problems where the cutoff can be proved (card shuffling, the Ehrenfests' urn), and shows that chains with polynomial growth (drunkard's walk) do not show cutoffs.
Explicit Expanders with Cutoff Phenomena
The cutoff phenomenon describes a sharp transition in the convergence of an ergodic finite Markov chain to equilibrium. Of particular interest is understanding this convergence for the simple random
Exact sampling with coupled Markov chains and applications to statistical mechanics
For many applications it is useful to sample from a finite set of objects in accordance with some particular distribution. One approach is to run an ergodic (i.e., irreducible aperiodic) Markov chain
Uniformity of the uncovered set of random walk and cutoff for lamplighter chains
We show that the measure on markings of Znd, d ≥ 3, with elements of {0, 1} given by i.i.d. fair coin flips on the range $\mathcal{R}$ of a random walk X run until time T and 0 otherwise becomes
...
1
2
3
...