Rigorous bounds for the bond percolation critical probability are determined for three Archimedean lattices: .7385 < pc((3, 122) bond) < .7449, .6430 < pc((4, 6, 12) bond) < .7376, .6281 < pc((4, 82) bond) < .7201. Consequently, the bond percolation critical probability of the (3, 122) lattice is strictly larger than those of the other ten Archimedean lattices. Thus, the (3, 122) bond percolation critical probability is possibly the largest of any vertex‐transitive graph with bond percolation critical probability that is strictly less than one.
No takes yet. Share an insight, caveat, or question.
John C. Wierman (2002) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: