The Application of Non-Crossing Partitions to Improving Percolation Threshold Bounds
From MaRDI portal
Publication:5295416
DOI10.1017/S0963548306007905zbMath1120.05006OpenAlexW1981225400MaRDI QIDQ5295416
William D. May, John C. Wierman
Publication date: 30 July 2007
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548306007905
Related Items (5)
New bounds for the site percolation threshold of the hexagonal lattice ⋮ On bond percolation threshold bounds for Archimedean lattices with degree three ⋮ A disproof of Tsallis' bond percolation threshold conjecture for the Kagome lattice ⋮ Empirical formula for site and bond percolation thresholds on Archimedean and 2-uniform lattices ⋮ A smaller upper bound for the \((4,8^2)\) lattice site percolation threshold
This page was built for publication: The Application of Non-Crossing Partitions to Improving Percolation Threshold Bounds
