The worm process for the Ising model is rapidly mixing
arXiv:1509.03201 · doi:10.1007/s10955-016-1572-2
Abstract
We prove rapid mixing of the worm process for the zero-field ferromagnetic Ising model, on all finite connected graphs, and at all temperatures. As a corollary, we obtain a fully-polynomial randomized approximation scheme for the Ising susceptibility, and for a certain restriction of the two-point correlation function
References in corpus (23)
- The Random-Cluster Model
- Worm algorithms for classical statistical models
- An introduction to Monte Carlo methods
- High Precision Measurement of the Thermal Exponent for the Three-Dimensional XY Universality Class
- Exact thresholds for Ising-Gibbs samplers on general graphs
- The mixing time evolution of Glauber dynamics for the mean-field Ising model
- Simulating the All-Order Strong Coupling Expansion I: Ising Model Demo
- Precision check on triviality of phi^4 theory by a new simulation method
- Simulating the All-Order Strong Coupling Expansion III: O(N) sigma/loop models
- Simulating the All-Order Strong Coupling Expansion IV: CP(N-1) as a loop model
- Swendsen-Wang is faster than single-bond dynamics
- Simulating the All-Order Hopping Expansion II: Wilson Fermions
- Comparison of Swendsen-Wang and Heat-Bath Dynamics
- Performance of a worm algorithm in theory at finite quartic coupling
- A Worm Algorithm for Two-Dimensional Spin Glasses
- Extended Scaling in High Dimensions
- Geometric Properties of the Three-Dimensional Ising and XY Models
- Rapid mixing of Swendsen-Wang and single-bond dynamics in two dimensions
- Critical Loop Gases and the Worm Algorithm
- Dual Geometric Worm Algorithm for Two-Dimensional Discrete Classical Lattice Models
- Simulating the All-Order Strong Coupling Expansion V: Ising Gauge Theory
- Random-Cluster Dynamics in
- Computational Study of a Multistep Height Model
Cited by in corpus (6)
- Lifted Worm Algorithm for the Ising Model
- Perturbative Removal of a Sign Problem
- Unwrapped two-point functions on high-dimensional tori
- Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models
- Approximating Pairwise Correlations in the Ising Model
- Hardness of Identity Testing for Restricted Boltzmann Machines and Potts models