Irreversible Markov chain Monte Carlo algorithm for self-avoiding walk
arXiv:1602.01671 · doi:10.1007/s11467-016-0646-6
Abstract
We formulate an irreversible Markov chain Monte Carlo algorithm for the self-avoiding walk (SAW), which violates the detailed balance condition and satisfies the balance condition. Its performance improves significantly compared to that of the Berretti-Sokal algorithm, which is a variant of the Metropolis-Hastings method. The gained efficiency increases with the spatial dimension (D), from approximately times in 2D to approximately times in 5D. We simulate the SAW on a 5D hypercubic lattice with periodic boundary conditions, for a system with a linear size up to , and confirm that as for the 5D Ising model, the finite-size scaling of the SAW is governed by renormalized exponents and . The critical point is determined, which is approximately times more precise than the best available estimate.
arXiv comment7 pages, 6 figures
References in corpus (17)
- 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
- Generalized event-chain Monte Carlo: Constructing rejection-free global-balance algorithms from infinitesimal steps
- Irreversible Monte Carlo Algorithms for Efficient Sampling
- A parallel algorithm for the enumeration of self-avoiding polygons on the square lattice
- Hyperscaling above the upper critical dimension
- Polymers Confined between Two Parallel Plane Walls
- Finite-size scaling above the upper critical dimension
- Event-chain Monte Carlo for classical continuous spin models
- 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
- Scaling of Self-Avoiding Walks in High Dimensions
- Geometric Allocation Approaches in Markov Chain Monte Carlo
Cited by in corpus (9)
- Random-length Random Walks and Finite-size scaling in high dimensions
- Geometric explanation of anomalous finite-size scaling in high dimensions
- Parallel PERM
- Lifted Worm Algorithm for the Ising Model
- Logarithmic finite-size scaling of the self-avoiding walk at four dimensions
- Unwrapped two-point functions on high-dimensional tori
- Lifted directed-worm algorithm
- Finite-Size Scaling of the High-Dimensional Ising Model in the Loop Representation
- Graphical Representations and Worm Algorithms for the O() Spin Model