Mixing time of critical Ising model on trees is polynomial in the height
From MaRDI portal
Publication:981702
DOI10.1007/S00220-009-0978-YzbMATH Open1201.82027arXiv0901.4152OpenAlexW2111981124MaRDI QIDQ981702FDOQ981702
Authors: Jian Ding, Eyal Lubetzky, Yuval Peres
Publication date: 2 July 2010
Published in: Communications in Mathematical Physics (Search for Journal in Brave)
Abstract: In the heat-bath Glauber dynamics for the Ising model on the lattice, physicists believe that the spectral gap of the continuous-time chain exhibits the following behavior. For some critical inverse-temperature , the inverse-gap is bounded for , polynomial in the surface area for and exponential in it for . This has been proved for except at criticality. So far, the only underlying geometry where the critical behavior has been confirmed is the complete graph. Recently, the dynamics for the Ising model on a regular tree, also known as the Bethe lattice, has been intensively studied. The facts that the inverse-gap is bounded for and exponential for were established, where is the critical spin-glass parameter, and the tree-height plays the role of the surface area. In this work, we complete the picture for the inverse-gap of the Ising model on the -ary tree, by showing that it is indeed polynomial in at criticality. The degree of our polynomial bound does not depend on , and furthermore, this result holds under any boundary condition. We also obtain analogous bounds for the mixing-time of the chain. In addition, we study the near critical behavior, and show that for , the inverse-gap and mixing-time are both .
Full work available at URL: https://arxiv.org/abs/0901.4152
Recommendations
Cites Work
- Potential theory on infinite networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Elementary bounds on Poincaré and log-Sobolev constants for decomposable Markov chains
- Mixing times of lozenge tiling and card shuffling Markov chains
- Can extra updates delay mixing?
- Comparison techniques for random walk on finite groups
- Broadcasting on trees and the Ising model.
- Logarithmic Sobolev inequalities for finite Markov chains
- Gibbs States on Countable Sets
- Comparison theorems for reversible Markov chains
- On the extremality of the disordered state for the Ising model on the Bethe lattice
- On the purity of the limiting Gibbs state for the Ising model on the Bethe lattice.
- Glauber dynamics on trees and hyperbolic graphs
- The Ising model and percolation on trees and tree-like graphs
- Nash inequalities for finite Markov chains
- The mixing time evolution of Glauber dynamics for the mean-field Ising model
- Morphisms and currents in infinite nonlinear resistive networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Glauber dynamics on the cycle is monotone
- Glauber dynamics on trees: Boundary conditions and mixing time
- Title not available (Why is that?)
- Dimension spectrum of Axiom A diffeomorphisms. I: The Bowen-Margulis measure
- Critical exponents from power spectra
- Title not available (Why is that?)
Cited In (16)
- Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width
- Title not available (Why is that?)
- Can extra updates delay mixing?
- Title not available (Why is that?)
- Phase transition for the mixing time of the Glauber dynamics for coloring regular trees
- Mixing time of a kinetically constrained spin model on trees: power law scaling at criticality
- Critical Ising on the square lattice mixes in polynomial time
- Spectral gap critical exponent for Glauber dynamics of hierarchical spin models
- Cutoff and dynamical phase transition for the general multi-component Ising model
- A new set of limiting Gibbs measures for the Ising model on a Cayley tree
- Title not available (Why is that?)
- Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width
- Glauber dynamics for the mean-field Potts model
- Elementary bounds on mixing times for decomposable Markov chains
- Polynomial Mixing of the Edge-Flip Markov Chain for Unbiased Dyadic Tilings
- Log‐Sobolev inequality for near critical Ising models
This page was built for publication: Mixing time of critical Ising model on trees is polynomial in the height
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q981702)