The worm process for the Ising model is rapidly mixing
From MaRDI portal
Publication:504198
DOI10.1007/S10955-016-1572-2zbMATH Open1362.82006arXiv1509.03201OpenAlexW2219192697MaRDI QIDQ504198FDOQ504198
Authors: Andrea Collevecchio, Timothy M. Garoni, Timothy Hyndman, Daniel V. Tokarev 
Publication date: 25 January 2017
Published in: Journal of Statistical Physics (Search for Journal in Brave)
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
Full work available at URL: https://arxiv.org/abs/1509.03201
Recommendations
- Random cluster dynamics for the Ising model is rapidly mixing
- Random cluster dynamics for the Ising model is rapidly mixing
- Mixing properties of the Swendsen-Wang process on the complete graph and narrow grids
- scientific article; zbMATH DE number 1305519
- Polynomial-Time Approximation Algorithms for the Ising Model
Computational methods in Markov chains (60J22) Numerical analysis or methods applied to Markov chains (65C40) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Statistical mechanics of magnetic materials (82D40)
Cites Work
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
- Random generation of combinatorial structures from a uniform distribution
- The complexity of partition functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Random-Cluster Model
- Geometric bounds for eigenvalues of Markov chains
- Polynomial-Time Approximation Algorithms for the Ising Model
- Approximating the Permanent
- Monte-Carlo approximation algorithms for enumeration problems
- Fixed Precision MCMC Estimation by Median of Products of Averages
- Approach to equilibrium of Glauber dynamics in the one phase region. I: The attractive case
- Title not available (Why is that?)
- Title not available (Why is that?)
- The mixing time evolution of Glauber dynamics for the mean-field Ising model
- Mixing properties of the Swendsen-Wang process on the complete graph and narrow grids
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- Chernoff-type bound for finite Markov chains
- A Chernoff Bound for Random Walks on Expander Graphs
- Exact thresholds for Ising-Gibbs samplers on general graphs
- Title not available (Why is that?)
- On the two-dimensional stochastic Ising model in the phase coexistence region near the critical point
- Critical Ising on the square lattice mixes in polynomial time
- 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
- An introduction to Monte Carlo methods
- Performance of a worm algorithm in \(\phi^4\) theory at finite quartic coupling
- Simulating the all-order strong coupling expansion. V: Ising gauge theory
- Lectures on probability theory and statistics. Ecole d'eté de Probabilités de Saint-Flour XXVII--1997, Saint-Flour, France, July 7--23, 1997
- ``Worm algorithm in quantum Monte Carlo simulations
- Lee-Yang theorems and the complexity of computing averages
- Comparison of Swendsen-Wang and heat-Bath dynamics
- A power law of order 1/4 for critical mean field Swendsen-Wang dynamics
- Title not available (Why is that?)
- Random-cluster dynamics in \(\mathbb{Z}^2\)
- Title not available (Why is that?)
- Swendsen-Wang is faster than single-bond dynamics
- Rapid mixing of Swendsen-Wang dynamics in two dimensions
- Critical loop gases and the worm algorithm
- Simulating the all-order strong coupling expansion. I: Ising model demo
- Simulating the all-order hopping expansion. II: Wilson fermions
Cited In (7)
- Unwrapped two-point functions on high-dimensional tori
- Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models
- Two-point functions of random-length random walk on high-dimensional boxes
- Beyond windability: approximability of the four-vertex model
- Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs
- Random cluster dynamics for the Ising model is rapidly mixing
- Hardness of identity testing for restricted Boltzmann machines and Potts models
This page was built for publication: The worm process for the Ising model is rapidly mixing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q504198)
