Off-lattice and parallel implementations of the pivot algorithm
arXiv:2001.02186 · doi:10.1088/1742-6596/2122/1/012008
Abstract
The pivot algorithm is the most efficient known method for sampling polymer configurations for self-avoiding walks and related models. Here we introduce two recent improvements to an efficient binary tree implementation of the pivot algorithm: an extension to an off-lattice model, and a parallel implementation.
arXiv comment7 pages, 2 figures. Presented at "Recent Developments in Computer Simulation Studies in Condensed Matter Physics" (32nd Annual CSP Workshop) in February 2019, and submitted for the workshop proceedings
References in corpus (4)
- Accurate estimate of the critical exponent for self-avoiding walks via a fast implementation of the pivot algorithm
- Efficient implementation of the pivot algorithm for self-avoiding walks
- Polymer simulation by means of tree data-structures and a parsimonious Metropolis algorithm
- Monte Carlo study of four-dimensional self-avoiding walks of up to one billion steps