# Percolation on two- and three-dimensional lattices.

@article{Martins2003PercolationOT,
title={Percolation on two- and three-dimensional lattices.},
author={Paulo H. L. Martins and Jo{\~a}o Ant{\^o}nio Plascak},
journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
year={2003},
volume={67 4 Pt 2},
pages={
046119
}
}
• Published 1 April 2003
• Physics
• Physical review. E, Statistical, nonlinear, and soft matter physics
In this work we apply a highly efficient Monte Carlo algorithm recently proposed by Newman and Ziff to treat percolation problems. The site and bond percolations are studied on a number of lattices in two and three dimensions. Quite good results for the wrapping probabilities, correlation length critical exponent, and critical concentration are obtained for the square, simple cubic, hexagonal close packed, and hexagonal lattices by using relatively small systems. We also confirm the universal…

## Figures and Tables from this paper

• Physics
Journal of Statistical Mechanics: Theory and Experiment
• 2020
We study the bootstrap and diffusion percolation models in the simple-cubic (sc), body-centered cubic (bcc), and face-centered cubic (fcc) lattices using the Newman–Ziff algorithm. The percolation
• Physics
• 2013
We present a study of site and bond percolation on periodic lattices with three nearest neighbors per site. Essentially all previous studies of percolation in 3D have considered coordination numbers
• Physics
• 2014
We present a study of site and bond percolation on periodic lattices with (on average) fewer than three nearest neighbors per site. We have studied this issue in two contexts: by simulating oxides
• Physics
Physical review. E, Statistical, nonlinear, and soft matter physics
• 2012
We carry out a high-precision Monte Carlo study of the shortest-path fractal dimension d(min) for percolation in two and three dimensions, using the Leath-Alexandrowicz method which grows a cluster
• Mathematics
Physical review. E, Statistical, nonlinear, and soft matter physics
• 2013
The bond and site percolation models are simulated on a simple-cubic lattice with linear sizes up to L=512, and various universal amplitudes are obtained, including wrapping probabilities, ratios associated with the cluster-size distribution, and the excess cluster number.
• Physics
Physical review. E, Statistical, nonlinear, and soft matter physics
• 2009
It is found that parameters nu and Rw,c exhibit not only strong temperature dependence but also, unlike the case of lattice systems, dependence on the nature of the system considered and the employed definition of the cluster.
• Physics
ACRI
• 2008
The lattice gas automata model is employed to simulate random walk over a square 2D site-percolation lattice to simulate the crossover between diffusion regimes and a quite good result was obtained for the critical exponent of diffusion coefficient.
• Physics
Physical review. E
• 2021
It is observed that the Berezinskii-Kosterlitz-Thouless system undergoes a percolation transition K_{perc} from a disordered phase consisting of small clusters into an ordered phase containing a giant percolating cluster in the low-temperature phase.

## References

SHOWING 1-10 OF 47 REFERENCES

• Mathematics
Physical review letters
• 2000
A new Monte Carlo algorithm is presented that is able to calculate quantities such as the cluster size distribution or spanning probability over the entire range of site or bond occupation probabilities from zero to one in a single run which takes an amount of time scaling linearly with the number of sites on the lattice.
• Physics
Physical review. E, Statistical, nonlinear, and soft matter physics
• 2001
An efficient algorithm is described that can measure an observable quantity in a percolation system for all values of the site or bond occupation probability from zero to one in an amount of time that scales linearly with the size of the system.
• Computer Science, Physics
• 2002
Using the PCC algorithm, the three-dimensional Ising model and the bond percolation problem is investigated and a refined finite-size scaling analysis is employed to make estimates of critical point and exponents.
• Mathematics
• 1975
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
• Mathematics
Physical review. E, Statistical, nonlinear, and soft matter physics
• 2002
This work shows that the convergence of the average-probability estimate is described by a nontrivial correction-to-scaling exponent as predicted previously, and measures the value of this exponent to be 0.90+/-0.02.
• Physics
• 1999
Using finite-size scaling techniques we obtain accurate results for critical quantities of the Ising model and the site percolation, in three dimensions. We pay special attention to parametrizing the
• Physics
• 1993
By studying transfer matrix eigenvalues, correlation lengths for a mean field directed percolation model are obtained both near and far from the critical regime. Near criticality, finite-size scaling
• Physics
• 1997
The partition function of the finite $1+\epsilon$ state Potts model is shown to yield a closed form for the distribution of clusters in the immediate vicinity of the percolation transition. Various
The author presents results of high-statistics simulations of the spreading of 2D percolation, and of backbones of 2D percolation clusters. While the algorithm employed for the spreading is more or