Monte Carlo estimates of critical percolation probabilities

Abstract

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 computer with a 32K word high-speed store has now enabled us to obtain results of a very high accuracy indeed; in those cases where our values for critical probabilities can be checked against exactly known values, they differ by no more than 0·1%.