Percolation in Networks with Voids and Bottlenecks
arXiv:0811.4575 · doi:10.1103/PhysRevE.79.021118
Abstract
A general method is proposed for predicting the asymptotic percolation threshold of networks with bottlenecks, in the limit that the sub-net mesh size goes to zero. The validity of this method is tested for bond percolation on filled checkerboard and "stack-of-triangle" lattices. Thresholds for the checkerboard lattices of different mesh sizes are estimated using the gradient percolation method, while for the triangular system they are found exactly using the triangle-triangle transformation. The values of the thresholds approach the asymptotic values of 0.64222 and 0.53993 respectively as the mesh is made finer, consistent with a direct determination based upon the predicted critical corner-connection probability.
to appear, Physical Review E. Small changes from first version
References in corpus (16)
- Percolation on correlated networks
- Four-tap shift-register-sequence random-number generators
- Exact Site Percolation Thresholds Using the Site-to-Bond and Star-Triangle Transformations
- Exact bond percolation thresholds in two dimensions
- Pseudorandom Number Generators and the Square Site Percolation Threshold
- Topological estimation of percolation thresholds
- Estimation of Bond Percolation Thresholds on the Archimedean Lattices
- Predictions of bond percolation thresholds for the kagomé and Archimedean lattices
- Critical surfaces for general bond percolation problems
- Universal condition for critical percolation thresholds of kagome-like lattices
- Rigorous confidence intervals for critical probabilities
- New critical frontiers for the Potts and percolation models
- Dimer percolation and jamming on simple cubic lattice
- Random Cluster Models on the Triangular Lattice
- Exact factorization of correlation functions in 2-D critical percolation
- Site Percolation on Planar Random Graphs
Cited by in corpus (11)
- Universal condition for critical percolation thresholds of kagome-like lattices
- How to Quantify and Avoid Finite Size Effects in Computational Studies of Crystal Nucleation: The Case of Heterogeneous Ice Nucleation
- Critical surfaces for general inhomogeneous bond percolation problems
- Critical frontier for the Potts and percolation models on triangular-type and kagome-type lattices II: Numerical analysis
- Polynomial sequences for bond percolation critical thresholds
- Critical frontier of the Potts and percolation models in triangular-type and kagome-type lattices I: Closed-form expressions
- Double percolation effects and fractal behavior in magnetic/superconducting hybrids
- Dimer Covering and Percolation Frustration
- Random site percolation on honeycomb lattices with complex neighborhoods
- Potts and percolation models on bowtie lattices
- Lower limit of percolation threshold on a square lattice with complex neighborhoods