A Faster Implementation of the Pivot Algorithm for Self-Avoiding Walks
Author:
- 1 February 2002
- journal article
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 106 (3-4) , 407-429
Abstract
No abstract availableKeywords
All Related Versions
This publication has 29 references indexed in Scilit:
- Monte Carlo results for three-dimensional self-avoiding walksNuclear Physics B - Proceedings Supplements, 1998
- Internal structure of polymer chainsPhysica A: Statistical Mechanics and its Applications, 1995
- Critical exponents, hyperscaling, and universal amplitude ratios for two- and three-dimensional self-avoiding walksJournal of Statistical Physics, 1995
- Random walks with short-range interaction and mean-field behaviorJournal of Statistical Physics, 1994
- Numerical study of self-avoiding walks on lattices and in the continuumMacromolecules, 1991
- Constrained random walks and vortex filaments in turbulence theoryCommunications in Mathematical Physics, 1990
- Monte Carlo simulation of tetrahedral chains. 1. Very long (athermal) chains by pivot algorithmMacromolecules, 1990
- Monte Carlo generation of self-avoiding walks with fixed endpoints and fixed lengthJournal of Statistical Physics, 1990
- The pivot algorithm: A highly efficient Monte Carlo method for the self-avoiding walkJournal of Statistical Physics, 1988
- Efficient computation of polymer conformation energyJournal of Computational Physics, 1971