Random cluster dynamics for the Ising model is rapidly mixing

DOI10.1214/17-AAP1335zbMath1395.82133arXiv1605.00139OpenAlexW2796897711WikidataQ129997274 ScholiaQ129997274MaRDI QIDQ1650104

Heng Guo, Mark R. Jerrum

Publication date: 29 June 2018

Published in: The Annals of Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

Markov chainsIsing modelrandom clusterSwendsen-Wang dynamics

Mathematics Subject Classification ID

Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20) Statistical mechanics of magnetic materials (82D40)

Related Items

Algorithmic Pirogov-Sinai theory, Random-cluster dynamics in \(\mathbb{Z}^2\): rapid mixing with general boundary conditions, Efficient sampling and counting algorithms for the Potts model on ℤ^d at all temperatures, Perfect sampling from spatial mixing, Swendsen-Wang dynamics for the ferromagnetic Ising model with external fields, Cutoff for the Swendsen-Wang dynamics on the lattice, Sampling from the low temperature Potts model through a Markov chain on flows, Low-temperature Ising dynamics with random initializations, Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs, Log-concave polynomials. II: High-dimensional walks and an FPRAS for counting bases of a matroid, Algorithms for #BIS-Hard Problems on Expander Graphs, Dynamic Sampling from Graphical Models, Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs

Cites Work

• Critical Ising on the square lattice mixes in polynomial time
• The worm process for the Ising model is rapidly mixing
• Geometric bounds for eigenvalues of Markov chains
• Inapproximability of the Tutte polynomial
• Markov chain comparison
• Random even graphs
• Approximate counting, uniform generation and rapidly mixing Markov chains
• Comparison theorems for reversible Markov chains
• The random-cluster model on the complete graph
• The Swendsen-Wang process does not always mix rapidly
• A Complete Dichotomy Rises from the Capture of Vanishing Signatures
• Comparison of Swendsen-Wang and heat-bath dynamics
• A power law of order 1/4 for critical mean-field Swendsen-Wang dynamics
• Polynomial-Time Approximation Algorithms for the Ising Model
• Approximating the Permanent
• Approximating the Partition Function of the Ferromagnetic Potts Model
• Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
• Random-Cluster Dynamics in ℤ²
• Swendsen--Wang Is Faster than Single-Bond Dynamics
• The Complexity of Computing the Sign of the Tutte Polynomial
• Dynamics for the mean-field random-cluster model
• Swendsen-Wang Algorithm on the Mean-Field Potts Model
• The Random-Cluster Model
• Rapid mixing of Swendsen–Wang dynamics in two dimensions
• Unnamed Item
• Unnamed Item