A nonlocal Monte Carlo algorithm for lattice trees
- 1 January 1992
- journal article
- Published by IOP Publishing in Journal of Physics A: General Physics
- Vol. 25 (2) , 303-333
- https://doi.org/10.1088/0305-4470/25/2/013
Abstract
A new nonlocal algorithm for the simulation of trees on the lattice Zd is proposed. The authors study the implementation and the properties of the algorithm, and show that it is decisively better than an algorithm which performs only local moves. They use the new algorithm to investigate the properties of lattice trees in two, three, four, eight and nine dimensions.Keywords
This publication has 37 references indexed in Scilit:
- Relaxation Monte Carlo for 3D branched polymers: The leading confluence exponentJournal of Statistical Physics, 1989
- Series study of random animals in general dimensionsPhysical Review B, 1988
- The pivot algorithm: A highly efficient Monte Carlo method for the self-avoiding walkJournal of Statistical Physics, 1988
- Lattice models of branched polymers: combs and brushesMacromolecules, 1987
- Lattice models of branched polymers: dimensions of uniform starsMacromolecules, 1986
- A new Monte Carlo simulation for two models of self-avoiding lattice trees in two dimensionsJournal of Statistical Physics, 1985
- Excluded volume effects for branched polymers: Monte Carlo resultsThe Journal of Chemical Physics, 1981
- Random paths and random surfaces on a digital computerPhysics Letters B, 1981
- Radius, perimeter, and density profile for percolation clusters and lattice animalsZeitschrift für Physik B Condensed Matter, 1979
- Monte Carlo Studies of Configurational and Thermodynamic Properties of Self-Interacting Linear Polymer ChainsThe Journal of Chemical Physics, 1968