Self-avoiding walks on strongly diluted lattices: Chain-growth simulations vs. exact enumeration

摘要

We discuss and compare two different methods that can be used to investigate self-avoiding walks on lattices with random site dilution. One is the so-called pruned-enriched Rosenbluth method (PERM), a chain-growth Monte Carlo algorithm, the other is a recently developed exact enumeration technique. While the latter is highly efficient for systems close to the critical concentration, it cannot be used for less dilute systems. PERM is more versatile but appears to have difficulties coping with strong confinement.