A Monte Carlo study of lattice trails

Abstract
The authors use the recently developed Monte Carlo algorithm of Berretti and Sokal (J. Stat. Phys. vol.40, p.483, 1985) to study the critical behaviour of lattice trails on the square and triangular lattices. They find support for the earlier belief that this problem is in the same universality class as self-avoiding walks. Accepting this, they obtain the most precise estimates to date of the connective constants. It is argued that this problem is particularly well suited to study by Monte Carlo methods rather than by series analysis.

This publication has 9 references indexed in Scilit: