The worm process for the Ising model is rapidly mixing
From MaRDI portal
(Redirected from Publication:504198)
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
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
Cites work
- scientific article; zbMATH DE number 3649800 (Why is no real title available?)
- scientific article; zbMATH DE number 1305538 (Why is no real title available?)
- scientific article; zbMATH DE number 1545676 (Why is no real title available?)
- scientific article; zbMATH DE number 1750693 (Why is no real title available?)
- scientific article; zbMATH DE number 1369837 (Why is no real title available?)
- scientific article; zbMATH DE number 1839431 (Why is no real title available?)
- scientific article; zbMATH DE number 1885142 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- A Chernoff Bound for Random Walks on Expander Graphs
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
- A power law of order 1/4 for critical mean field Swendsen-Wang dynamics
- An introduction to Monte Carlo methods
- Approach to equilibrium of Glauber dynamics in the one phase region. I: The attractive case
- Approximating the Permanent
- Chernoff-type bound for finite Markov chains
- Comparison of Swendsen-Wang and heat-Bath dynamics
- Critical Ising on the square lattice mixes in polynomial time
- Critical loop gases and the worm algorithm
- Exact thresholds for Ising-Gibbs samplers on general graphs
- Fixed Precision MCMC Estimation by Median of Products of Averages
- Geometric bounds for eigenvalues of Markov chains
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- Lectures on probability theory and statistics. Ecole d'eté de Probabilités de Saint-Flour XXVII--1997, Saint-Flour, France, July 7--23, 1997
- Lee-Yang theorems and the complexity of computing averages
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Mixing properties of the Swendsen-Wang process on the complete graph and narrow grids
- Monte-Carlo approximation algorithms for enumeration problems
- On the two-dimensional stochastic Ising model in the phase coexistence region near the critical point
- Performance of a worm algorithm in \(\phi^4\) theory at finite quartic coupling
- Polynomial-Time Approximation Algorithms for the Ising Model
- Random generation of combinatorial structures from a uniform distribution
- Random-cluster dynamics in \(\mathbb{Z}^2\)
- Rapid mixing of Swendsen-Wang dynamics in two dimensions
- Simulating the all-order hopping expansion. II: Wilson fermions
- Simulating the all-order strong coupling expansion. I: Ising model demo
- 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
- Simulating the all-order strong coupling expansion. V: Ising gauge theory
- Swendsen-Wang is faster than single-bond dynamics
- The Random-Cluster Model
- The complexity of partition functions
- The mixing time evolution of Glauber dynamics for the mean-field Ising model
- ``Worm algorithm in quantum Monte Carlo simulations
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)
