A smaller upper bound for the \((4,8^2)\) lattice site percolation threshold

DOI10.1007/978-3-031-05375-7_24zbMath1501.05013OpenAlexW4295836609MaRDI QIDQ2089559

John C. Wierman

Publication date: 22 October 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-05375-7_24

zbMATH Keywords

set partitionsnon-crossing partitionssite percolationpercolation threshold

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Partitions of sets (05A18) Graph theory (including graph drawing) in computer science (68R10) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43) Connectivity (05C40) Infinite graphs (05C63)

Cites Work

• A disproof of Tsallis' bond percolation threshold conjecture for the Kagome lattice
• The critical probability of bond percolation on the square lattice equals 1/2
• Tight bounds for the bond percolation threshold of the (3, 12²) lattice
• Critical probability bounds for two-dimensional site percolation models
• Bond percolation on honeycomb and triangular lattices
• Substitution Method Critical Probability Bounds for the Square Lattice Site Percolation Model
• A new lower bound for the critical probability of site percolation on the square lattice
• The Application of Non-Crossing Partitions to Improving Percolation Threshold Bounds
• Using Symmetry to Improve Percolation Threshold Bounds
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A smaller upper bound for the \((4,8^2)\) lattice site percolation threshold