Monte Carlo simulation of 3D self-avoiding walks
- 21 June 1993
- journal article
- Published by IOP Publishing in Journal of Physics A: General Physics
- Vol. 26 (12) , 2769-2776
- https://doi.org/10.1088/0305-4470/26/12/017
Abstract
Presents simulation results for 3D self-avoiding walks of moderate length (N<or=2000), using a recently introduced recursive sampling method. It is shown that this method is indeed maximally efficient for determining the connectivity constant mu . Combining the data with previous results from exact enumerations and from simulations of very long walks using the pivot algorithm, the author obtains very precise estimates of mu and of the critical exponents gamma and nu . He also points out significant deviations from uniformity in a very popular random number generator which was considered safe until now.Keywords
This publication has 14 references indexed in Scilit:
- Recursive sampling of random walks: self-avoiding walks in disordered mediaJournal of Physics A: General Physics, 1993
- Spreading and backbone dimensions of 2D percolationJournal of Physics A: General Physics, 1992
- Self-avoiding walks in two to five dimensions: exact enumerations and series studyJournal of Physics A: General Physics, 1992
- Directed percolation in 2+1 dimensionsJournal of Physics A: General Physics, 1989
- On the critical behaviour of self-avoiding walks. IIJournal of Physics A: General Physics, 1989
- Repulsion of random and self-avoiding walks from excluded points and linesJournal of Physics A: General Physics, 1989
- The pivot algorithm: A highly efficient Monte Carlo method for the self-avoiding walkJournal of Statistical Physics, 1988
- New Monte Carlo method for the self-avoiding walkJournal of Statistical Physics, 1985
- On three-dimensional self-avoiding walksJournal of Physics A: General Physics, 1985
- Position-space renormalisation group for isolated polymer chainsJournal of Physics A: General Physics, 1981