Nonlocal Monte Carlo algorithm for self-avoiding walks with fixed endpoints |
| |
| Authors: | Sergio Caracciolo Andrea Pelissetto Alan D. Sokal |
| |
| Affiliation: | (1) Scuola Normale Superiore and INFN-Sezione di Pisa, 56100 Pisa, Italy;(2) Department of Physics, New York University, 10003 New York, New York |
| |
| 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 N3.0. We also prove some rigorous bounds on the autocorrelation time for these and related Monte Carlo algorithms. |
| |
| Keywords: | Self-avoiding walk polymer Monte Carlo pivot algorithm BFACF algorithm cut-and-paste critical exponent |
| 本文献已被 SpringerLink 等数据库收录！ |
