Abstract
We study a new Monte Carlo algorithm for generating self-avoiding walks with variable length (controlled by a fugacity β) and fixed endpoints. The algorithm is a hybrid of local (BFACF) and nonlocal (cut-and-paste) moves. We find that the critical slowing-down, measured in units of computer time, is reduced compared to the pure BFACF algorithm:τCPU∼ 〈N〉≈2.3 versus 〈N〉≈3.0. We also prove some rigorous bounds on the autocorrelation time for these and related Monte Carlo algorithms.
Original language | English (US) |
---|---|
Pages (from-to) | 1-53 |
Number of pages | 53 |
Journal | Journal of Statistical Physics |
Volume | 60 |
Issue number | 1-2 |
DOIs | |
State | Published - Jul 1990 |
Keywords
- BFACF algorithm
- Monte Carlo
- Self-avoiding walk
- critical exponent
- cut-and-paste
- pivot algorithm
- polymer
ASJC Scopus subject areas
- Statistical and Nonlinear Physics
- Mathematical Physics