We discuss the dynamic critical behaviour of a hybrid Monte Carlo algorithm for the self-avoidings walks of variable length and fixed endpoints. A local algorithm is augmented by non-local cut-and-paste moves, which speed up equilibration within the subspace of walks with fixed length. The percentage of non-local moves can be optimized to get the lowest dynamic critical exponent for the autocorrelation time in CPU units.
ASJC Scopus subject areas
- Atomic and Molecular Physics, and Optics
- Nuclear and High Energy Physics