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 memory. From this walk, the percolation threshold pc for a two-dimensional lattice can be determined with apparently maximum efficiency for a naive Monte Carlo calculation (+or-N-12/). For a square lattice, the value pc=0.592745+or-0.000002 is found for a simulation of N=2.6*1011 total steps (occupied and blocked perimeter sites). The power of the method is verified on the Kagome site percolation case.

[1]  J. Clerc,et al.  Size dependence of the percolation threshold of square and triangular network , 1976 .

[2]  D. Stauffer.  Exact distribution of cluster size and perimeter for two-dimensional percolation , 1976 .

[3]  Bernard Sapoval,et al.  The fractal nature of a diffusion front and the relation to percolation , 1985 .

[4]  T Gebele,et al.  Site percolation threshold for square lattice , 1984 .

[5]  D. Rapaport.  Monte Carlo experiments on percolation: the influence of boundary conditions , 1985 .

[6]  D. Gaunt,et al.  Percolation processes in two dimensions. II. Critical concentrations and the mean size index , 1976 .

[7]  Ziff.  Test of scaling exponents for percolation-cluster perimeters. , 1986, Physical review letters.

[8]  E. Monberg,et al.  Percolation and cluster distribution. II. layers, variable-range interactions, and exciton cluster model , 1978 .

[9]  Rosso,et al.  Determination of percolation probability from the use of a concentration gradient. , 1985, Physical review. B, Condensed matter.

[10]  Peter Reynolds,et al.  Large-cell Monte Carlo renormalization group for percolation , 1980 .

[11]  B. Derrida,et al.  Corrections to scaling and phenomenological renormalization for 2-dimensional percolation and lattice animal problems , 1985 .

[12]  R. Ziff,et al.  Generation of percolation cluster perimeters by a random walk , 1984 .

[13]  J. W. Essam,et al.  Some Exact Critical Percolation Probabilities for Bond and Site Problems in Two Dimensions , 1963 .

[14]  J. W. Essam,et al.  Critical Percolation Probabilities by Series Methods , 1964 .

[15]  H. E. Stanley,et al.  Site percolation threshold for honeycomb and square lattices , 1982 .

[16]  C. Domb,et al.  Cluster Size in Random Mixtures and Percolation Processes , 1961 .

[17]  Extrapolation of transfer matrix data for percolation and lattice animals by the Romberg-Beleznay algorithm , 1986 .

[18]  P. Dean.  A new Monte Carlo method for percolation problems on a lattice , 1963, Mathematical Proceedings of the Cambridge Philosophical Society.

[19]  B. R. Heap,et al.  Equivalence of the Critical Concentrations in the Ising and Heisenberg Models of Ferromagnetism , 1960 .