Generation of percolation cluster perimeters by a random walk
- 21 October 1984
- journal article
- Published by IOP Publishing in Journal of Physics A: General Physics
- Vol. 17 (15) , 3009-3017
- https://doi.org/10.1088/0305-4470/17/15/018
Abstract
A type of self-avoiding random walk which generates the perimeter of two-dimensional lattice-percolation clusters is given. The algorithm has been stimulated on a computer, yielding the mean perimeter length as a function of occupation probability.Keywords
This publication has 33 references indexed in Scilit:
- Scaling behavior of diffusion on percolation clustersPhysical Review A, 1983
- New Universality Class for Kinetic GelationPhysical Review Letters, 1982
- Site percolation threshold for honeycomb and square latticesJournal of Physics A: General Physics, 1982
- Critically branched chains and percolation clustersPhysics Letters A, 1980
- Percolation and cluster distribution. I. Cluster multiple labeling technique and critical concentration algorithmPhysical Review B, 1976
- Cluster Shape and Critical Exponents near Percolation ThresholdPhysical Review Letters, 1976
- Cluster shapes in lattice gases and percolationJournal of Physics A: General Physics, 1975
- Collapse of a polymer chain in poor solventsJournal de Physique Lettres, 1975
- The theory of condensation and the critical pointPhysics Physique Fizika, 1967
- Percolation processesMathematical Proceedings of the Cambridge Philosophical Society, 1957