A monte carlo study of lattice trails

Abstract

We use the recently developed Monte Carlo algorithm of Berretti and Sokal to study the critical behaviour of lattice trails on the square and triangular lattices. We find support for the earlier belief that this problem is in the same universality class as selfavoiding walks. Accepting this, we obtain the most precise estimates to date of the connective constants. I t is argued that this problem is particularly well suited to study by Monte Carlo methods rather than by series analysis. © 1988 IOP Publishing Ltd.