hep-lat/9405016 17 May 1994 Contents Page 1 hep-lat/9405016 17 May 1994 MONTE
CARLO METHODS FOR THE SELF-AVOIDING WALK ALAN D. SOKAL Department of Physics …

We implement a scale-free version of the pivot algorithm and use it to sample pairs of three-
dimensional self-avoiding walks, for the purpose of efficiently calculating an observable that …

It is proved that every dynamic Monte Carlo algorithm for the self-avoiding walk based on a
finite repertoire of local, N-conserving elementary moves is nonergodic (here N is the …

The pivot algorithm is a Markov Chain Monte Carlo algorithm for simulating the self-avoiding
walk. At each iteration a pivot which produces a global change in the walk is proposed. If the …

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 …

We propose a new class of dynamic Monte Carlo algorithms for generating self-avoiding
walks uniformly from the ensemble with fixed endpoints and fixed length in any dimension …

The pivot algorithm is a dynamic Monte Carlo algorithm, first invented by Lal, which
generates self-avoiding walks (SAWs) in a canonical (fixed-N) ensemble with free endpoints …

We calculate the connective constant for self-avoiding walks on the simple cubic lattice to
unprecedented accuracy, using a novel application of the pivot algorithm. We estimate that …

Abstract High-precision Monte Carlo data are used to estimate the exponents which govern
the asymptotic behaviour of the recently introduced indefinitely-growing self-avoiding walk in …

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 …