Monte Carlo estimates of critical percolation probabilities

@article{Dean1967MonteCE,
  title={Monte Carlo estimates of critical percolation probabilities},
  author={P. Dean and N F Bird},
  journal={Mathematical Proceedings of the Cambridge Philosophical Society},
  year={1967},
  volume={63},
  pages={477 - 479}
}
  • P. DeanN. Bird
  • Published 1 April 1967
  • Physics
  • Mathematical Proceedings of the Cambridge Philosophical Society
In this paper we present results for the critical percolation probabilities of a number of two- and three-dimensional lattices. These results are based upon Monte Carlo studies of the way in which cluster-size distributions vary as the number of occupied sites in a lattice is progressively increased; the principle of the method has been described in some detail in an earlier publication (Dean (1)) in which the results of studies carried out on the ACE computer were reported. The use of a KDF 9… 

Monte Carlo studies of percolation phenomena for a simple cubic lattice

The site-percolation problem on a simple cubic lattice is studied by the Monte Carlo method. By combining results for periodic lattices of different sizes through the use of finite-size scaling

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

Monte Carlo experiment for the two-dimensional site percolation network

A Monte Carlo computer experiment gives the bulk conductivity of a 200*200 site square resistor network consisting of two kinds of unit resistor with difference conductance. An enumeration of

Monte Carlo study of the percolating cluster for the square lattice site problem

Clusters which just span finite lattices of various sizes have been generated using a Monte Carlo method. These have been analysed to form estimates of the mean values of cyclomatic index, valence

Metropolis Monte Carlo simulation of lattice animals

This work estimates autocorrelation times and dynamical exponents to study the efficiency of the algorithm, and estimates the metric and branch exponents of lattice animals in two and three dimensions.

Series expansion study of the pair connectedness in bond percolation models

The pair connectedness C(r,p) in a percolation model is the probability that a lattice site at position r belongs to a finite cluster containing the origin when neighbouring sites are connected with

Diffusion, correlation, and percolation in a random alloy

Abstract The relationship between physical correlation and tracer correlation in a random alloy and their bearing on the site percolation problem are discussed. Four Monte Carlo schemes are described

Estimates of critical percolation probabilities for a set of two-dimensional lattices

  • D. Neal
  • Mathematics
    Mathematical Proceedings of the Cambridge Philosophical Society
  • 1972
Abstract This paper describes new detailed Monte Carlo investigations into bond and site percolation problems on the set of eleven regular and semi-regular (Archimedean) lattices in two dimensions.

Critical exponents for conduction in a honeycomb random site lattice

Monte Carlo simulation conductivity calculations for the honeycomb random site resistor lattice have been performed for lattice sizes from 200*200 at higher site fractions up to 1400*1400 near

References

SHOWING 1-4 OF 4 REFERENCES

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

A new Monte Carlo method for percolation problems on a lattice

  • P. Dean
  • Physics
    Mathematical Proceedings of the Cambridge Philosophical Society
  • 1963
Abstract A new and general Monte Carlo technique is described for solving some well-known percolation and cluster-size problems on regular lattice networks. The method has been applied to ten