Nathan Clisby, Dac Thanh Chuong Ho
Published 2020-01-07Version 1
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.
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
Efficient implementation of the pivot algorithm for self-avoiding walks
An Off-lattice Model for Br Electrodeposition on Au(100): from DFT to Experiment
Accurate estimate of the critical exponent $ν$ for self-avoiding walks via a fast implementation of the pivot algorithm
![QR code for arXiv:2001.02186 [cond-mat.stat-mech]](http://oss.arxitics.com/images/favicon.svg)