A new Monte Carlo simulation for two models of self-avoiding lattice trees in two dimensions

By means of a new Monte Carlo sampling of a grand canonical ensemble, we verify universality for the critical exponents and of two models of lattice trees constrained to be self-avoiding on sites or on bonds. The attrition constants are also obtained. This algorithm, a generalization of that recently proposed by Berretti and Sokal for random walks, appears to optimize the critical slowing down in the scaling region. Systematic and statistical errors are carefully estimated.