Join- and-cut algorithm for self-avoiding walks with variable length and free endpoints
- 1 April 1992
- journal article
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 67 (1-2) , 65-111
- https://doi.org/10.1007/bf01049027
Abstract
No abstract availableKeywords
This publication has 34 references indexed in Scilit:
- Dynamic critical exponent of the BFACF algorithm for self-avoiding walksJournal of Statistical Physics, 1991
- Monte Carlo generation of self-avoiding walks with fixed endpoints and fixed lengthJournal of Statistical Physics, 1990
- Exponential convergence to equilibrium for a class of random-walk modelsJournal of Statistical Physics, 1989
- Generalization of the Fortuin-Kasteleyn-Swendsen-Wang representation and Monte Carlo algorithmPhysical Review D, 1988
- The pivot algorithm: A highly efficient Monte Carlo method for the self-avoiding walkJournal of Statistical Physics, 1988
- Polymer conformations through 'wiggling'Journal of Physics A: General Physics, 1985
- New Monte Carlo method for the self-avoiding walkJournal of Statistical Physics, 1985
- Random paths and random surfaces on a digital computerPhysics Letters B, 1981
- Position-space renormalisation group for isolated polymer chainsJournal of Physics A: General Physics, 1981
- Configurational properties of model lattice chains under varying solvent conditionsBritish Polymer Journal, 1977