Bond and site percolation in three dimensions.

@article{Wang2013BondAS,
  title={Bond and site percolation in three dimensions.},
  author={Junfeng Wang and Zongzheng Zhou and Wei Zhang and Timothy M. Garoni and Youjin Deng},
  journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
  year={2013},
  volume={87 5},
  pages={
          052107
        }
}
We simulate the bond and site percolation models on a simple-cubic lattice with linear sizes up to L=512, and estimate the percolation thresholds to be p(c)(bond)=0.24881182(10) and p(c)(site)=0.3116077(2). By performing extensive simulations at these estimated critical points, we then estimate the critical exponents 1/ν=1.1410(15), β/ν=0.47705(15), the leading correction exponent y(i)=-1.2(2), and the shortest-path exponent d(min)=1.3756(3). Various universal amplitudes are also obtained… 

N-cluster correlations in four- and five-dimensional percolation

We study N-cluster correlation functions in four- and five-dimensional (4D and 5D) bond percolation by extensive Monte Carlo simulation. We reformulate the transfer Monte Carlo algorithm for

Precise bond percolation thresholds on several four-dimensional lattices

We study bond percolation on several four-dimensional (4D) lattices, including the simple (hyper) cubic (SC), the SC with combinations of nearest neighbors and second nearest neighbors (SC-NN+2NN),

History-dependent percolation in two dimensions.

The history-dependent percolation in two dimensions, which evolves in generations from standard bond-percolation configurations through iteratively removing occupied bonds, undergoes a continuous phase transition, which, for any finite number of generations, falls into the universality of standard two-dimensional (2D)Percolation.

Bond percolation on simple cubic lattices with extended neighborhoods.

The results show that the percolation thresholds of these and other three-dimensional lattices decrease monotonically with the coordination number z quite accurately according to a power-law p_{c}∼z^{-a} with exponent a=1.111.

Fully-connected bond percolation on Z d

We consider the bond percolation model on the lattice Z d ( d ≥ 2) with the constraint to be fully connected. Each edge is open with probability p ∈ ( 0 , 1 ) , closed with probability 1 − p and then

Fully-connected bond percolation on Z

We consider the bond percolation model on the lattice Zd (d ≥ 2) with the constraint to be fully connected. Each edge is open with probability p ∈ (0, 1), closed with probability 1 − p and then the

Simultaneous analysis of three-dimensional percolation models

We simulate the bond and site percolation models on several three-dimensional lattices, including the diamond, body-centered cubic, and face-centered cubic lattices. As on the simple-cubic lattice

Simultaneous analysis of three-dimensional percolation models

We simulate the bond and site percolation models on several three-dimensional lattices, including the diamond, body-centered cubic, and face-centered cubic lattices. As on the simple-cubic lattice

Percolation of disordered jammed sphere packings

We determine the site and bond percolation thresholds for a system of disordered jammed sphere packings in the maximally random jammed state, generated by the Torquato–Jiao algorithm. For the site

Critical percolation clusters in seven dimensions and on a complete graph.

It is demonstrated that the geometric structure of high-dimensional percolation clusters cannot be fully accounted for by their complete-graph counterparts.
...

References

SHOWING 1-10 OF 34 REFERENCES

Monte Carlo study of the site-percolation model in two and three dimensions.

  • Youjin DengH. Blöte
  • Physics, Mathematics
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2005
A Monte Carlo algorithm is introduced that in fact simulates systems with size L(d-1) x infinity, where L specifies the linear system size, and which can be regarded either as an extension of the Hoshen-Kopelman method or as a special case of the transfer-matrix Monte Carlo technique.

Precise determination of the bond percolation thresholds and finite-size scaling corrections for the sc, fcc, and bcc lattices

Extensive Monte-Carlo simulations were performed to study bond percolation on the simple cubic (s.c.), face-centered cubic (f.c.c.), and body-centered cubic (b.c.c.) lattices, using an epidemic kind

Percolation transitions in two dimensions.

The amplitude of the power-law correction associated with X_{t2}=4 is found to be dependent on the orientation of the lattice with respect to the cylindrical geometry of the finite systems.

Tree graph inequalities and critical behavior in percolation models

Various inequalities are derived and used for the study of the critical behavior in independent percolation models. In particular, we consider the critical exponent γ associated with the expected

Crossover from isotropic to directed percolation.

The directed percolation model is generalized by relaxing the strict directionality of DP such that propagation can occur in either direction but with anisotropic probabilities, and this model with two main growth directions biased directedPercolation (BDP) is called.

Universality of the excess number of clusters and the crossing probability function in three-dimensional percolation

Extensive Monte Carlo simulations were performed to evaluate the excess number of clusters and the crossing probability function for three-dimensional percolation on the simple cubic (s.c.),

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

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.

Percolation on two- and three-dimensional lattices.

A highly efficient Monte Carlo algorithm recently proposed by Newman and Ziff is applied to treat percolation problems to confirm the universal aspect of the wrapping probabilities regarding site and bond dilution.