Generation of percolation cluster perimeters by a random walk

  title={Generation of percolation cluster perimeters by a random walk},
  author={Robert M. Ziff and Peter T. Cummings and G. Stells},
  journal={Journal of Physics A},
A type of self-avoiding random walk whish generates the perimeter of two- dimensional lattice-percolation clusters is given. The algorithm has been simulated on a computer, yielding the mean perimeter length as a function of occupation probability. 

Figures from this paper

Percolation and self-avoiding random loops

Presents simulations supporting the conjecture that properly defined exterior perimeters of 2D critical percolation clusters have the same fractal dimension, D=4/3, as self-avoiding random walks. In

Structure of backbone perimeters of percolation clusters

The author studies perimeters of backbones of percolation clusters at the percolation threshold in two dimensions. These perimeters are self-avoiding for all lattices. They simulate these perimeters

COMMENT: On the hull of two-dimensional percolation clusters

A recently proven equivalence between certain random walks with memory and the hull of percolation clusters in two dimensions is used to estimate the fractal dimension of the latter by means of Monte

Scaling behaviour of cluster hulls in spiral site percolation

The scaling behaviour of the percolation hull rotationally constrained site percolation on the square and triangular lattices is studied. The single cluster growth method has been used to determine

Exact solution of a kinetic self-avoiding walk on a fractal

The indefinitely growing self-avoiding walk is solved exactly on a regular fractal, the Sierpinski gasket. The fractal dimension D=In 5/In 2-1 differs from the value of D for the equilibrium

New universality classes in “Percolative” dynamics

We study a site analogue of directed percolation. Random trajectories are generated and their critical behavior is studied. The critical behavior corresponds to that of simple percolation in some of

The efficient determination of the percolation threshold by a frontier-generating walk in a gradient

The frontier in gradient percolation is generated directly by a type of self-avoiding random walk. The existence of the gradient permits one to generate an infinite walk on a computer of finite

Structure and perimeters of percolation clusters

Site percolation clusters are simulated at the percolation threshold on the square lattice. An algorithm for walks around each cluster is used to obtain information on its fractal geometry. The



Percolation on a randomly expanded lattice: a model of polymer gels

The authors discuss a random expansion of a lattice in which a series of 2-valent vertices are inserted between the original vertices of the lattice. The critical exponents do not change under this

Simulations of a stochastic model for cluster growth on a square lattice

An irreversible stochastic model for the growth of clusters on a square lattice is formulated and studied by Monte Carlo simulation. The growth rate has a nonlinear nonlocal dependence on the density

The ramification of large clusters near percolation threshold

A general upper bound to the perimeter polynomial is demonstrated for the site percolation problem and it is concluded that at percolation threshold p=pc the limiting mean perimeter-to-size ratio of

Diffusion-limited aggregation, a kinetic critical phenomenon

A model for random aggregates is studied by computer simulation. The model is applicable to a metal-particle aggregation process whose correlations have been measured previously. Density correlations

Scaling form for percolation cluster sizes and perimeters

Randomly generated clusters of sites on the triangular lattice at and just below pc, and clusters previously generated on the square lattice are analysed to determine their scaling form. The scaling

Exact Critical Percolation Probabilities for Site and Bond Problems in Two Dimensions

An exact method for determining the critical percolation probability, pc, for a number of two‐dimensional site and bond problems is described. For the site problem on the plane triangular lattice pc

Cluster shapes in lattice gases and percolation

An analysis is undertaken of the mean surface s of clusters of size n from Monte Carlo data simulating a two-dimensional Ising model. At sufficiently high temperatures the data represent a

Excluded volume effects for branched polymers: Monte Carlo results

As a simple model of randomly branched polymers, we consider the different ways that N‐bond trees may be self‐avoidingly embedded on a lattice. A general Monte Carlo approach is developed and

Thermally driven phase transitions near the percolation threshold in two dimensions

It is shown that thermally driven magnetic critical phenomena just above and just below the percolation limit can be usefully analysed using scaling theory, a further assumption concerning cluster