The worm process for the Ising model is rapidly mixing
From MaRDI portal
Publication:504198
DOI10.1007/s10955-016-1572-2zbMath1362.82006arXiv1509.03201OpenAlexW2219192697MaRDI QIDQ504198
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)
Full work available at URL: https://arxiv.org/abs/1509.03201
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)
Related Items
Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models ⋮ Random cluster dynamics for the Ising model is rapidly mixing ⋮ Unwrapped two-point functions on high-dimensional tori ⋮ Beyond windability: approximability of the four-vertex model ⋮ Unnamed Item ⋮ Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Critical Ising on the square lattice mixes in polynomial time
- Critical loop gases and the worm algorithm
- Simulating the all-order strong coupling expansion. IV: \(CP(N - 1)\) as a loop model
- Geometric bounds for eigenvalues of Markov chains
- Simulating the all-order strong coupling expansion. I: Ising model demo
- Simulating the all-order hopping expansion. II: Wilson fermions
- The mixing time evolution of Glauber dynamics for the mean-field Ising model
- Random generation of combinatorial structures from a uniform distribution
- On the two-dimensional stochastic Ising model in the phase coexistence region near the critical point
- Chernoff-type bound for finite Markov chains
- Approach to equilibrium of Glauber dynamics in the one phase region. I: The attractive case
- An introduction to Monte Carlo methods
- Exact thresholds for Ising-Gibbs samplers on general graphs
- Performance of a worm algorithm in \(\phi^4\) theory at finite quartic coupling
- Simulating the all-order strong coupling expansion. V: Ising gauge theory
- Simulating the all-order strong coupling expansion. III: \(O(N)\) sigma/loop models
- 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
- The complexity of partition functions
- Mixing properties of the Swendsen–Wang process on the complete graph and narrow grids
- Comparison of Swendsen-Wang and heat-bath dynamics
- A power law of order 1/4 for critical mean-field Swendsen-Wang dynamics
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
- Polynomial-Time Approximation Algorithms for the Ising Model
- Approximating the Permanent
- Monte-Carlo approximation algorithms for enumeration problems
- A Chernoff Bound for Random Walks on Expander Graphs
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- Random-Cluster Dynamics in ℤ2
- Swendsen--Wang Is Faster than Single-Bond Dynamics
- Fixed Precision MCMC Estimation by Median of Products of Averages
- The Random-Cluster Model
- Rapid mixing of Swendsen–Wang dynamics in two dimensions
This page was built for publication: The worm process for the Ising model is rapidly mixing
