Mixing time for the Ising model: a uniform lower bound for all graphs

DOI10.1214/10-AIHP402zbMATH Open1274.82012arXiv0909.5162OpenAlexW2031016175MaRDI QIDQ1944667FDOQ1944667

Authors: Jian Ding, Yuval Peres 

Publication date: 26 March 2013

Published in: Annales de l'Institut Henri Poincaré. Probabilités et Statistiques (Search for Journal in Brave)

Abstract: Consider Glauber dynamics for the Ising model on a graph of $n$ vertices. Hayes and Sinclair showed that the mixing time for this dynamics is at least $nlogn/f(Delta)$, where $Delta$ is the maximum degree and $f(Delta)=Theta(Deltalo{g}^{2}Delta)$. Their result applies to more general spin systems, and in that generality, they showed that some dependence on $Delta$ is necessary. In this paper, we focus on the ferromagnetic Ising model and prove that the mixing time of Glauber dynamics on any $n$-vertex graph is at least $(1/4+o(1))nlogn$.

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

Recommendations

• The mixing time evolution of Glauber dynamics for the mean-field Ising model
• Glauber dynamics for the mean-field Ising model: cut-off, critical power law, and metastability
• A general lower bound for mixing of single-site dynamics on graphs
• Glauber dynamics on nonamenable graphs: boundary conditions and mixing time
• Glauber dynamics on trees: Boundary conditions and mixing time

zbMATH Keywords

Ising modelmixing timeGaluber dynamics

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Cites Work

• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Glauber dynamics for the mean-field Ising model: cut-off, critical power law, and metastability
• Can extra updates delay mixing?
• Cutoff for the Ising model on the lattice
• Title not available (Why is that?)
• Glauber dynamics on the cycle is monotone
• Minimization algorithms and random walk on the d-cube
• A general lower bound for mixing of single-site dynamics on graphs

Cited In (10)

• Optimal strong stationary times for random walks on the chambers of a hyperplane arrangement
• Mixing of the Glauber dynamics for the ferromagnetic Potts model
• Exact thresholds for Ising-Gibbs samplers on general graphs
• Can extra updates delay mixing?
• Mixing times for a constrained Ising process on the torus at low density
• Rapid mixing of Gibbs sampling on graphs that are sparse on average
• Title not available (Why is that?)
• A general lower bound for mixing of single-site dynamics on graphs
• Some circumstances where extra updates can delay mixing
• Glauber dynamics for Ising model on convergent dense graph sequences

This page was built for publication: Mixing time for the Ising model: a uniform lower bound for all graphs

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