Work

Monte Carlo simulation of 3D self-avoiding walks

Year: 1993
Type: article
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.
Language: English
Open Access status: bronze
OpenAlex ID: W1998901165
FWCI: 3.389
Cites: 15
Cited by: 78
Related to: 9