Self-dual planar hypergraphs and exact bond percolation thresholds

Abstract

Recent research on percolation has led to the construction of an infinite class of lattices for which the percolation thresholds can be determined exactly. We discuss the mathematical basis for the solutions of bond percolation models, and, in particular, attempt to address some misconceptions that might arise from the seminal articles by Ziff and Scullard. As one consequence, we show that there exist infinitely many real numbers $a\in [0,1]$ for which there are infinitely many lattices that have bond percolation threshold equal to $a$.

18 pages, 8 figures, new title, revised introduction, other minor revisions

References in corpus (6)

• The critical probability for random Voronoi percolation in the plane is 1/2
• Exact Site Percolation Thresholds Using the Site-to-Bond and Star-Triangle Transformations
• Predictions of bond percolation thresholds for the kagomé and Archimedean $(3,12^2)$ lattices
• New critical frontiers for the Potts and percolation models
• Random Cluster Models on the Triangular Lattice
• Equality of bond percolation critical exponents for pairs of dual lattices