Simple cubic random-site percolation thresholds for neighborhoods containing fourth-nearest neighbors.

@article{Malarz2014SimpleCR,
  title={Simple cubic random-site percolation thresholds for neighborhoods containing fourth-nearest neighbors.},
  author={Krzysztof Malarz},
  journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
  year={2014},
  volume={91 4},
  pages={
          043301
        }
}
  • K. Malarz
  • Published 8 December 2014
  • Computer Science
  • Physical review. E, Statistical, nonlinear, and soft matter physics
In this paper, random-site percolation thresholds for a simple cubic (SC) lattice with site neighborhoods containing next-next-next-nearest neighbors (4NN) are evaluated with Monte Carlo simulations. A recently proposed algorithm with low sampling for percolation thresholds estimation (Bastas et al., arXiv:1411.5834) is implemented for the studies of the top-bottom wrapping probability. The obtained percolation thresholds are p(C)(4NN)=0.31160(12),p(C)(4NN+NN)=0.15040(12),p(C)(4NN+2NN)=0.15950… 

Figures and Tables from this paper

Site percolation thresholds on triangular lattice with complex neighborhoods.

A fast Monte Carlo algorithm is used for determining thresholds pc for random site percolation on a triangular lattice for neighborhoods containing nearest (NN), next-nearest (2NN, next-next-Nearest (3NN), and next-Next-next -next-ne nearest (4NN) neighbors, and their combinations forming regular hexagons.

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),

Site and bond percolation on four-dimensional simple hypercubic lattices with extended neighborhoods

The asymptotic behavior of the percolation threshold p c and its dependence upon coordination number z is investigated for both site and bond percolation on four-dimensional lattices with compact

Random site percolation on honeycomb lattices with complex neighborhoods.

We present a rough estimation-up to four significant digits, based on the scaling hypothesis and the probability of belonging to the largest cluster vs the occupation probability-of the critical

Site percolation on square and simple cubic lattices with extended neighborhoods and their continuum limit.

By means of extensive Monte Carlo simulation, extended-range site percolation on square and simple cubic lattices with various combinations of nearest neighbors up to the eighth nearest neighbors for the square lattice and the ninth nearestNeighborhoods are found using a single-cluster growth algorithm.

Site and bond percolation thresholds on regular lattices with compact extended-range neighborhoods in two and three dimensions.

Extended-range percolation on various regular lattices, including all 11 Archimedean lattices in two dimensions and the simple cubic (sc), body-centered cubic (bcc), and face-centered cubic (fcc)

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.

Percolation thresholds on a triangular lattice for neighborhoods containing sites up to the fifth coordination zone.

We determine thresholds p_{c} for random-site percolation on a triangular lattice for all available neighborhoods containing sites from the first to the fifth coordination zones, including their

From discrete to continuous percolation in dimensions 3 to 7

The convergence of a discrete model to its continuous limit is controlled by a power-law dependency with a universal exponent θ=3/2, which allows us to estimate the continuous percolation thresholds in a model of aligned hypercubes in dimensions d=3,…,7 with accuracy far better than that attained using any other method before.

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

References

SHOWING 1-10 OF 69 REFERENCES

Square-lattice site percolation at increasing ranges of neighbor bonds.

  • K. MalarzS. Galam
  • Physics
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2005
The existing Galam-Mauger universal formula for percolation thresholds does not reproduce the data showing dimension and coordination number are not sufficient to build a universal law which extends to complex lattices.

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.

Restoring site percolation on damaged square lattices.

  • S. GalamK. Malarz
  • Physics
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2005
Restoring site percolation on a damaged square lattice with the nearest neighbor (N2) is investigated using two different strategies, each of which adds new longer range links to N2 but only for a fraction of the remaining non-destroyed sites.

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.

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.),

An analytical method to compute an approximate value of the site percolation threshold Pc

An analytical method to compute the site percolation threshold is introduced and yields an approximate value of Pc larger or equal to the real value.

Numerical studies of critical percolation in three dimensions

Presents results of high-statistics simulations of the spreading of 3D percolation close to the critical point. The main results are: (i) a more precise estimate of the spreading (resp. 'chemical

New algorithm to test percolation conditions within the Newman-Ziff algorithm

An algorithm to verify the existence of both clusters touching boundaries at an arbitrary point and single-loop clusters continuously connecting the opposite boundaries in a percolating system with periodic boundary conditions is proposed within the Newman–Ziff algorithm.

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
...