Percolation in Finite Matching Lattices

Abstract

We derive an exact, simple relation between the average number of clusters and the wrapping probabilities for two-dimensional percolation. The relation holds for periodic lattices of any size. It generalizes a classical result of Sykes and Essam and it can be used to find exact or very accurate approximations of the critical density. The criterion that follows is related to the criterion Scullard and Jacobsen use to find precise approximate thresholds, and our work provides a new perspective on their approach.

8 pages, 8 figures

References in corpus (2)

• Exact bond percolation thresholds in two dimensions
• Topological estimation of percolation thresholds

Cited by in corpus (15)

• Homological Percolation and the Euler Characteristic
• Critical polynomials in the nonplanar and continuum percolation models
• Bond percolation on simple cubic lattices with extended neighborhoods
• Bond percolation thresholds on Archimedean lattices from critical polynomial roots
• Percolation Thresholds in Hyperbolic Lattices
• Quantum Search Approaches to Sampling-Based Motion Planning
• Universal features of cluster numbers in percolation
• Universal Critical Behavior of Percolation in Orientationally Ordered Janus Particles and Other Anisotropic Systems
• Exact Percolation Probability on the Square Lattice
• Euler Number and Percolation Threshold on a Square Lattice with Diagonal Connection Probability and Revisiting the Island-Mainland Transition
• Exact percolation probabilities for a square lattice: Site percolation on a plane, cylinder, and torus
• Percolation is Odd
• Percolation in two-species antagonistic random sequential adsorption in two dimensions
• Iterative Site Percolation on Triangular Lattice
• Critical points of the random cluster model with Newman-Ziff sampling