New Monte Carlo method for the self-avoiding walk |
| |
Authors: | Alberto Berretti Alan D Sokal |
| |
Institution: | (1) Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, 10012 New York, New York |
| |
Abstract: | We introduce a new Monte Carlo algorithm for the self-avoiding walk (SAW), and show that it is particularly efficient in the critical region (long chains). We also introduce new and more efficient statistical techniques. We employ these methods to extract numerical estimates for the critical parameters of the SAW on the square lattice. We find=2.63820 ± 0.00004 ± 0.00030=1.352 ± 0.006 ± 0.025v=0.7590 ± 0.0062 ± 0.0042 where the first error bar represents systematic error due to corrections to scaling (subjective 95% confidence limits) and the second bar represents statistical error (classical 95% confidence limits). These results are based on SAWs of average length 166, using 340 hours CPU time on a CDC Cyber 170–730. We compare our results to previous work and indicate some directions for future research. |
| |
Keywords: | Self-avoiding walk polymer lattice model critical exponents Monte Carlo algorithm maximum-likelihood estimation |
本文献已被 SpringerLink 等数据库收录! |