Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Home
  • Home
Hostname: page-component-559fc8cf4f-7x8lp Total loading time: 0.25 Render date: 2021-03-01T17:13:42.461Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": false, "newCiteModal": false, "newCitedByModal": true }
EnglishFrançais
Combinatorics, Probability and Computing Combinatorics, Probability and Computing

Article contents

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)
Get access
Rights & Permissions[Opens in a new window]

Abstract

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.

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

Access options

Get access to the full version of this content by using one of the access options below.
If you should have access and can't see this content please contact technical support.

Full text views

Full text views reflects PDF downloads, PDFs sent to Google Drive, Dropbox and Kindle and HTML full text views.

Total number of HTML views: 1
Total number of PDF views: 26 *
View data table for this chart

* Views captured on Cambridge Core between September 2016 - 1st March 2021. This data will be updated every 24 hours.

5 Cited by

Send article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

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

Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

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

Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

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

Reply to: Submit a response

Your details

Conflicting interests

Do you have any conflicting interests? *