Percolation threshold bounds for the 2-uniform (3, 4, 3, 12; 3, {12}^2) lattice

MaRDI QIDQ5224832zbMATH OpenFDO

Authors Gabrielle Moss, John C. Wierman

Publication date 24 July 2019

zbMATH Keywords

2-uniform latticesnetwork flow algorithmsnon-crossing partitionspartition latticessubstitution methodsymmetry reductions

Mathematics Subject Classification ID

Graph operations (line graphs, products, etc.) (05C76) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43)

Recommendations

• Tight bounds for the bond percolation threshold of the \((3,12^{2})\) lattice
• Strict inequalities between bond percolation thresholds of Archimedean lattices
• On bond percolation threshold bounds for Archimedean lattices with degree three
• A smaller upper bound for the (4,8²) lattice site percolation threshold
• Bond percolation threshold bounds for planar lattices with generators with four boundary vertices

Cited in

(4)

• Empirical formula for site and bond percolation thresholds on Archimedean and 2-uniform lattices
• A smaller upper bound for the (4,8²) lattice site percolation threshold
• Bond percolation threshold bounds for planar lattices with generators with four boundary vertices
• Tight bounds for the bond percolation threshold of the \((3,12^{2})\) lattice

This page was built for publication: Percolation threshold bounds for the 2-uniform ($3, 4, 3, 12; 3, {12}^2$) lattice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5224832)