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

DOI10.1214/10-AIHP402zbMath1274.82012arXiv0909.5162OpenAlexW2031016175MaRDI QIDQ1944667

Yuval Peres, Jian Ding

Publication date: 26 March 2013

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

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

zbMATH Keywords

Ising modelmixing timeGaluber dynamics

Mathematics Subject Classification ID

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

Related Items

Can extra updates delay mixing?, Unnamed Item, Some circumstances where extra updates can delay mixing, Optimal strong stationary times for random walks on the chambers of a hyperplane arrangement

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Can extra updates delay mixing?
• Glauber dynamics for the mean-field Ising model: cut-off, critical power law, and metastability
• Minimization algorithms and random walk on the d-cube
• Glauber dynamics on the cycle is monotone
• Cutoff for the Ising model on the lattice
• A general lower bound for mixing of single-site dynamics on graphs