The Library
Site percolation and isoperimetric inequalities for plane graphs
Tools
Tools
Tools
Haslegrave, John and Panagiotis, Christoforos (2020) Site percolation and isoperimetric inequalities for plane graphs. Random Structures and Algorithms . doi:10.1002/rsa.20946 (In Press)
|
PDF
WRAP-Site-percolation-isoperimetric-inequalities-forplane-graphs-Haslegrave-2020.pdf - Published Version - Requires a PDF viewer. Available under License Creative Commons Attribution 4.0. Download (425Kb) | Preview |
|
![[img]](http://wrap.warwick.ac.uk/style/images/fileicons/application_pdf.png) |
PDF
WRAP-site-percolation-isoperimetric-inequalities-plane-graphs-Haslegrave-2020.pdf - Accepted Version Embargoed item. Restricted access to Repository staff only - Requires a PDF viewer. Download (867Kb) |
Official URL: https://doi.org/10.1002/rsa.20946
Abstract
We use isoperimetric inequalities combined with a new technique to prove upper bounds for the site percolation threshold of plane graphs with given minimum degree conditions. In the process we prove tight new isoperimetric bounds for certain classes of hyperbolic graphs. This establishes the vertex isoperimetric constant for all triangular and square hyperbolic lattices, answering a question of Lyons and Peres. We prove that plane graphs of minimum degree at least 7 have site percolation threshold bounded away from 1/2, which was conjectured by Benjamini and Schramm, and make progress on a conjecture of Angel, Benjamini, and Horesh that the critical probability is at most 1/2 for plane triangulations of minimum degree 6. We prove additional bounds for stronger minimum degree conditions, and for graphs without triangular faces.
| Item Type: | Journal Article | ||||||||
|---|---|---|---|---|---|---|---|---|---|
| Subjects: | Q Science > QA Mathematics | ||||||||
| Divisions: | Faculty of Science > Mathematics | ||||||||
| Library of Congress Subject Headings (LCSH): | Graph theory, Isoperimetric inequalities, Percolation (Statistical physics) | ||||||||
| Journal or Publication Title: | Random Structures and Algorithms | ||||||||
| Publisher: | John Wiley & Sons, Inc. | ||||||||
| ISSN: | 1042-9832 | ||||||||
| Official Date: | 2020 | ||||||||
| Dates: |
|
||||||||
| Date of first compliant deposit: | 22 May 2020 | ||||||||
| DOI: | 10.1002/rsa.20946 | ||||||||
| Status: | Peer Reviewed | ||||||||
| Publication Status: | In Press | ||||||||
| Publisher Statement: | This is the peer reviewed version of the following article: [FULL CITE], which has been published in final form at [Link to final article using the DOI]. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Use of Self-Archived Versions. | ||||||||
| Access rights to Published version: | Restricted or Subscription Access | ||||||||
| RIOXX Funder/Project Grant: |
|
||||||||
| Related URLs: |
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
