Lifted Worm Algorithm for the Ising Model
arXiv:1711.05346 · doi:10.1103/PhysRevE.97.042126
Abstract
We design an irreversible worm algorithm for the zero-field ferromagnetic Ising model by using the lifting technique. We study the dynamic critical behavior of an energy estimator on both the complete graph and toroidal grids, and compare our findings with reversible algorithms such as the Prokof'ev-Svistunov worm algorithm. Our results show that the lifted worm algorithm improves the dynamic exponent of the energy estimator on the complete graph, and leads to a significant constant improvement on toroidal grids.
arXiv comment9 pages, 6 figures
References in corpus (23)
- Worm Algorithm for Continuous-space Path Integral Monte Carlo Simulations
- Worm algorithms for classical statistical models
- 2D Melting: From Liquid-Hexatic Coexistence to Continuous Transitions
- Hard-disk equation of state: First-order liquid-hexatic transition in two dimensions with three simulation methods
- Event-chain Monte Carlo algorithms for hard-sphere systems
- Markov Chain Monte Carlo Method without Detailed Balance
- Irreversible Monte Carlo Algorithms for Efficient Sampling
- Critical behaviour of the Ising model on the 4-dimensional lattice
- Finite-size scaling above the upper critical dimension
- Event-chain Monte Carlo for classical continuous spin models
- Simulating the All-Order Strong Coupling Expansion I: Ising Model Demo
- On the role of Fourier modes in finite-size scaling above the upper critical dimension
- Event-chain algorithm for the Heisenberg model: Evidence for dynamic scaling
- Dynamics of the One-Dimensional Ising Model without Detailed Balance Condition
- Finite size scaling of the 5D Ising model with free boundary conditions
- Some things we've learned (about Markov chain Monte Carlo)
- Worm Monte Carlo study of the honeycomb-lattice loop model
- Geometric explanation of anomalous finite-size scaling in high dimensions
- Critical speeding-up in a local dynamics for the random-cluster model
- The worm process for the Ising model is rapidly mixing
- Irreversible Markov chain Monte Carlo algorithm for self-avoiding walk
- Quasi-Reliable Estimates of Effective Sample Size
- Critical speed-up vs critical slow-down: a new kind of relaxation oscillation with application to stick-slip phenomena
Cited by in corpus (11)
- Monte Carlo study of duality and the Berezinskii-Kosterlitz-Thouless phase transitions of the two-dimensional -state clock model in flow representations
- Worm-algorithm-type Simulation of Quantum Transverse-Field Ising Model
- Loop-Cluster Coupling and Algorithm for Classical Statistical Models
- Logarithmic finite-size scaling of the self-avoiding walk at four dimensions
- Control of probability flow in Markov chain Monte Carlo -- Nonreversibility and lifting
- Geometric properties of the complete-graph Ising model in the loop representation
- Geometric allocation approach to accelerating directed worm algorithm
- Lifted directed-worm algorithm
- Finite-Size Scaling of the High-Dimensional Ising Model in the Loop Representation
- Logarithmic Finite-Size Scaling of the Four-Dimensional Ising Model
- Graphical Representations and Worm Algorithms for the O() Spin Model