Simple Cubic Random-Site Percolation Thresholds for Complex Neighbourhoods

@article{Kurzawski2011SimpleCR,
  title={Simple Cubic Random-Site Percolation Thresholds for Complex Neighbourhoods},
  author={Lukasz Kurzawski and Krzysztof Malarz},
  journal={Reports on Mathematical Physics},
  year={2011},
  volume={70},
  pages={163-169}
}

Figures and Tables from this paper

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

  • K. Malarz
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2015
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.

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

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.

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)

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

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

References

SHOWING 1-10 OF 63 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.

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.

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.

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

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

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.

Similarity of Percolation Thresholds on the HCP and FCC Lattices

Extensive Monte Carlo simulations were performed in order to determine the precise values of the critical thresholds for site (phcpc, S=0.199 255 5±0.000 001 0) and bond (phcpc, B=0.120 164 0±0.000

Percolation processes in two dimensions. II. Critical concentrations and the mean size index

For pt.I see ibid., vol.9, p.87 (1976). New series data are examined for the mean cluster size for site and bond mixtures in two dimensions. The critical concentration for the site problem on the

Random Site Percolation in Three Dimensions

We simulate sytems up to 10 001 × 10 001 × 10 001 in three dimensions at the percolation threshold pc of 0.31160. We find that the fractal dimension is ≃2.53±0.02, the cluster size distribution
...