Percolation on two- and three-dimensional lattices.

  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},
  volume={67 4 Pt 2},
  • P. MartinsJ. A. Plascak
  • 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

Bootstrap and diffusion percolation transitions in three-dimensional lattices

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

Percolation thresholds on three-dimensional lattices with three nearest neighbors

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

Site percolation on lattices with low average coordination numbers

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

Shortest-path fractal dimension for percolation in two and three dimensions.

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

Universality class of the percolation in two-dimensional lattices with distortion

Bond and site percolation in three dimensions.

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.

Percolation threshold parameters of fluids.

  • J. ŠkvorI. Nezbeda
  • 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.

Lattice Gas Automata Simulation of 2D Site-Percolation Diffusion: Configuration Dependence of the Theoretically Expected Crossover of Diffusion Regime

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.

Percolation of the two-dimensional XY model in the flow representation.

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.



Efficient Monte Carlo algorithm and high-precision results for percolation.

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.

Fast Monte Carlo algorithm for site or bond percolation.

  • M. NewmanR. Ziff
  • 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.

Probability-Changing Cluster Algorithm: Study of Three-Dimensional Ising Model and Percolation Problem

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.

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

Convergence of threshold estimates for two-dimensional percolation.

  • R. ZiffM. Newman
  • 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.

Scaling corrections: Site percolation and Ising model in three-dimensions

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

Finite-size scaling for mean-field percolation

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

Cluster distribution in mean-field percolation: Scaling and universality

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

Spreading and backbone dimensions of 2D percolation

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