Estimation of Bond Percolation Thresholds on the Archimedean Lattices

Abstract

We give accurate estimates for the bond percolation critical probabilities on seven Archimedean lattices, for which the critical probabilities are unknown, using an algorithm of Newman and Ziff.

2 figures. Updated Table 1

References in corpus (1)

• Rigorous confidence intervals for critical probabilities

Cited by in corpus (7)

• Percolation thresholds on 2D Voronoi networks and Delaunay triangulations
• Topological estimation of percolation thresholds
• Critical surfaces for general bond percolation problems
• Universal condition for critical percolation thresholds of kagome-like lattices
• Rigorous confidence intervals for critical probabilities
• Percolation in Networks with Voids and Bottlenecks
• Supplementary material: Topological estimation of percolation thresholds