Hostname: page-component-74656f9884-2dmjx Total loading time: 0 Render date: 2026-11-09T17:50:19.384Z Has data issue: false hasContentIssue false
  • English
  • Français

An Improved Upper Bound for the Hexagonal Lattice Site Percolation Critical Probability

Published online by Cambridge University Press:  21 November 2002

JOHN C. WIERMAN
JOHN C. WIERMAN
Affiliation:
Mathematical Sciences Department, 104 Whitehead Hall, Johns Hopkins University, Baltimore, Maryland, MD 21218-2682, USA (e-mail: wierman@jhu.edu)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The hexagonal lattice site percolation critical probability is shown to be at most 0.79472, improving the best previous mathematically rigorous upper bound. The bound is derived by using the substitution method to compare the site model with the bond model, the latter of which is exactly solved. Shortcuts which eliminate a substantial amount of computation make the derivation of the bound possible.

Information

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 11 , Issue 6 , November 2002 , pp. 629 - 643
Copyright
2002 Cambridge University Press