Percolation in Networks with Voids and Bottlenecks

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 (12)

• Percolation on correlated networks
• 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
• Critical surfaces for general bond percolation problems
• Predictions of bond percolation thresholds for the kagomé and Archimedean $(3,12^2)$ lattices
• Universal condition for critical percolation thresholds of kagome-like lattices
• Rigorous confidence intervals for critical probabilities
• Dimer percolation and jamming on simple cubic lattice
• Exact factorization of correlation functions in 2-D critical percolation
• Site Percolation on Planar ${\Phi }^3$ Random Graphs

Cited by in corpus (1)

• Universal condition for critical percolation thresholds of kagome-like lattices