Inequality of two critical probabilities for percolation

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

For a locally finite, connected graph G with distinguished vertex 0, let pc(G) be the usual critical probability for bond percolation on G, and pcut(G) = sup(p: infΠ Ep|C(0)⋂ Π| = 0) (≤pc), where Π ranges over cutsets (sets of vertices “separating 0 from ∞”), Ep refers to (Bernoulli bond) percolation with p the probability that an edge is open, and C(0) is the open cluster containing 0.(The definition is easily seen to be independent of the choice of distinguished vertex.) We disprove a conjecture of Russ Lyons stating that pcut(G) = pc(G) for every G, and propose a possible alternative.

Original languageEnglish (US)
Pages (from-to)184-187
Number of pages4
JournalElectronic Communications in Probability
Volume8
DOIs
StatePublished - Jan 1 2003

Fingerprint

Critical Probability
Cutset
Disprove
Vertex of a graph
Bernoulli
Connected graph
Alternatives
Range of data
Graph

All Science Journal Classification (ASJC) codes

  • Statistics and Probability
  • Statistics, Probability and Uncertainty

Keywords

  • Critical probability
  • Percolation

Cite this

@article{3f622ce576cc49589a0678d83174019e,
title = "Inequality of two critical probabilities for percolation",
abstract = "For a locally finite, connected graph G with distinguished vertex 0, let pc(G) be the usual critical probability for bond percolation on G, and pcut(G) = sup(p: infΠ Ep|C(0)⋂ Π| = 0) (≤pc), where Π ranges over cutsets (sets of vertices “separating 0 from ∞”), Ep refers to (Bernoulli bond) percolation with p the probability that an edge is open, and C(0) is the open cluster containing 0.(The definition is easily seen to be independent of the choice of distinguished vertex.) We disprove a conjecture of Russ Lyons stating that pcut(G) = pc(G) for every G, and propose a possible alternative.",
keywords = "Critical probability, Percolation",
author = "Jeffry Kahn",
year = "2003",
month = "1",
day = "1",
doi = "10.1214/ECP.v8-1099",
language = "English (US)",
volume = "8",
pages = "184--187",
journal = "Electronic Communications in Probability",
issn = "1083-589X",
publisher = "Institute of Mathematical Statistics",

}

Inequality of two critical probabilities for percolation. / Kahn, Jeffry.

In: Electronic Communications in Probability, Vol. 8, 01.01.2003, p. 184-187.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Inequality of two critical probabilities for percolation

AU - Kahn, Jeffry

PY - 2003/1/1

Y1 - 2003/1/1

N2 - For a locally finite, connected graph G with distinguished vertex 0, let pc(G) be the usual critical probability for bond percolation on G, and pcut(G) = sup(p: infΠ Ep|C(0)⋂ Π| = 0) (≤pc), where Π ranges over cutsets (sets of vertices “separating 0 from ∞”), Ep refers to (Bernoulli bond) percolation with p the probability that an edge is open, and C(0) is the open cluster containing 0.(The definition is easily seen to be independent of the choice of distinguished vertex.) We disprove a conjecture of Russ Lyons stating that pcut(G) = pc(G) for every G, and propose a possible alternative.

AB - For a locally finite, connected graph G with distinguished vertex 0, let pc(G) be the usual critical probability for bond percolation on G, and pcut(G) = sup(p: infΠ Ep|C(0)⋂ Π| = 0) (≤pc), where Π ranges over cutsets (sets of vertices “separating 0 from ∞”), Ep refers to (Bernoulli bond) percolation with p the probability that an edge is open, and C(0) is the open cluster containing 0.(The definition is easily seen to be independent of the choice of distinguished vertex.) We disprove a conjecture of Russ Lyons stating that pcut(G) = pc(G) for every G, and propose a possible alternative.

KW - Critical probability

KW - Percolation

UR - http://www.scopus.com/inward/record.url?scp=3042521545&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=3042521545&partnerID=8YFLogxK

U2 - 10.1214/ECP.v8-1099

DO - 10.1214/ECP.v8-1099

M3 - Article

AN - SCOPUS:3042521545

VL - 8

SP - 184

EP - 187

JO - Electronic Communications in Probability

JF - Electronic Communications in Probability

SN - 1083-589X

ER -