Simulations of lattice animals and trees
Hsiao-Ping Hsu, Walter Nadler, and Peter Grassberger

TL;DR
This paper uses a biased sampling algorithm to simulate lattice animals and trees across multiple dimensions, verifying theoretical predictions, estimating critical exponents, and exploring surface adsorption and collapse phenomena.
Contribution
It introduces a modified PERM algorithm for high-dimensional lattice animals and trees, providing high-precision estimates and verifying key theoretical predictions.
Findings
Verifies Parisi-Sourlas prediction in all dimensions studied
Provides precise estimates of growth constants for d >= 3
Confirms superuniversality of the crossover exponent at adsorption transition
Abstract
The scaling behaviour of randomly branched polymers in a good solvent is studied in two to nine dimensions, using as microscopic models lattice animals and lattice trees on simple hypercubic lattices. As a stochastic sampling method we use a biased sequential sampling algorithm with re-sampling, similar to the pruned-enriched Rosenbluth method (PERM) used extensively for linear polymers. Essentially we start simulating percolation clusters (either site or bond), re-weigh them according to the animal (tree) ensemble, and prune or branch the further growth according to a heuristic fitness function. In contrast to previous applications of PERM, this fitness function is {\it not} the weight with which the actual configuration would contribute to the partition sum, but is closely related to it. We obtain high statistics of animals with up to several thousand sites in all dimension 2 <= d <=…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
