Exact thresholds for Ising-Gibbs samplers on general graphs
From MaRDI portal
Publication:1942118
DOI10.1214/11-AOP737zbMath1270.60113arXiv0903.2906MaRDI QIDQ1942118
Publication date: 15 March 2013
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0903.2906
phase transitionrandom graphsconvergence rateIsing modeltightnesstreesGlauber dynamicsGibbs samplingrapid mixing
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)
Related Items
Spatial mixing and the connective constant: optimal bounds, Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction, Random-cluster dynamics in \(\mathbb {Z}^2\), Entropy decay in the Swendsen-Wang dynamics on \(\mathbb{Z}^d\), Equi-energy sampling does not converge rapidly on the mean-field Potts model with three colors close to the critical temperature, Can extra updates delay mixing?, Continuous spin models on annealed generalized random graphs, Random-cluster dynamics in \(\mathbb{Z}^2\): rapid mixing with general boundary conditions, Glauber dynamics for Ising models on random regular graphs: cut-off and metastability, Counting Solutions to Random CNF Formulas, Perfect sampling from spatial mixing, Unnamed Item, The Swendsen–Wang dynamics on trees, Critical behavior of the annealed Ising model on random regular graphs, Unnamed Item, Unnamed Item, Sampling from Potts on random graphs of unbounded degree via random-cluster dynamics, Unnamed Item, Unnamed Item, Some circumstances where extra updates can delay mixing, The Ising partition function: zeros and deterministic approximation, Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model, The worm process for the Ising model is rapidly mixing, Metastability of the Ising model on random regular graphs at zero temperature, Approximating stationary distributions of fast mixing Glauber dynamics, with applications to exponential random graphs, Random-cluster dynamics on random regular graphs in tree uniqueness, Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs, Unnamed Item, Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results, Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model, Dynamic Sampling from Graphical Models, On mixing of Markov chains: coupling, spectral independence, and entropy factorization
Cites Work
- Coupling with the stationary distribution and improved sampling for colorings and independent sets
- Ising models on locally tree-like graphs
- On the hardness of sampling independent sets beyond the tree threshold
- The logarithmic Sobolev inequality for discrete spin systems on a lattice
- Approach to equilibrium of Glauber dynamics in the one phase region. I: The attractive case
- Approach to equilibrium of Glauber dynamics in the one phase region. II: The general case
- Coexistence of infinite \((*)\)-clusters. II: Ising percolation in two dimensions
- Glauber dynamics on trees: Boundary conditions and mixing time
- Glauber dynamics on trees and hyperbolic graphs
- The Ising model and percolation on trees and tree-like graphs
- Approximating partition functions of the two-state spin system
- A general lower bound for mixing of single-site dynamics on graphs
- Improved bounds for sampling colorings
- Counting independent sets up to the tree threshold
- Rapid mixing of Gibbs sampling on graphs that are sparse on average
- Approximating the Permanent
- Information, Physics, and Computation
- Mixing in time and space for lattice spin systems: A combinatorial view
- Gibbs states and the set of solutions of random constraint satisfaction problems
- Combinatorial criteria for uniqueness of Gibbs measures
- Quasi-factorization of the entropy and logarithmic Sobolev inequalities for Gibbs random fields
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
