Off-lattice and parallel implementations of the pivot algorithm
Statistical Mechanics
2021-12-22 v1 Computational Physics
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.
Cite
@article{arxiv.2001.02186,
title = {Off-lattice and parallel implementations of the pivot algorithm},
author = {Nathan Clisby and Dac Thanh Chuong Ho},
journal= {arXiv preprint arXiv:2001.02186},
year = {2021}
}
Comments
7 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