Parallel PERM
arXiv:2002.03000 · doi:10.1088/1751-8121/ab8ff7
Abstract
We develop and implement a parallel flatPERM algorithm \cite{G97,PK04} with mutually interacting parallel flatPERM sequences and use it to sample self-avoiding walks in 2 and 3 dimensions. Our data show that the parallel implementation accelerates the convergence of the flatPERM algorithm. Moreover, increasing the number of interacting flatPERM sequences (rather than running longer simulations) improves the rate of convergence. This suggests that a more efficient implementation of flatPERM will be a massively parallel implementation, rather than long simulations of one, or a few parallel sequences. We also use the algorithm to estimate the growth constant of the self-avoiding walk in two and in three dimensions using simulations over 12 parallel sequences. Our best results are \[ μ_d = \cases{ 2.6381585(1), & \hbox{if }; \cr 4.684039(1), & \hbox{if }. } \]
References in corpus (8)
- An efficient, multiple range random walk algorithm to calculate the density of states
- Understanding and Improving the Wang-Landau Algorithm
- Wang-Landau Algorithm: a Theoretical Analysis of the Saturation of the Error
- A new transfer-matrix algorithm for exact enumerations: Self-avoiding polygons on the square lattice
- Optimal Modification Factor and Convergence of the Wang-Landau Algorithm
- Calculation of the connective constant for self-avoiding walks via the pivot algorithm
- Scale-free Monte Carlo method for calculating the critical exponent of self-avoiding walks
- Irreversible Markov chain Monte Carlo algorithm for self-avoiding walk
Cited by in corpus (9)
- Polymer collapse of a self-avoiding trail model on a two-dimensional inhomogeneous lattice
- Numerical estimates of square lattice star vertex exponents
- Lattice star and acyclic branched polymer vertex exponents in 3d
- Phase diagrams of confined square lattice links
- Self-avoiding walks pulled at an angle
- Entropic exponents of grafted lattices stars
- Compressed self-avoiding walks in two and three dimensions
- Lattice polymers near a permeable interface
- The escape transition in a self-avoiding walk model of linear polymers