Development of Mathematics, 1950–2000 2000
DOI: 10.1007/978-3-0348-8968-1_18
|View full text |Cite
|
Sign up to set email alerts
|

Percolation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

2
167
0

Year Published

2000
2000
2023
2023

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 97 publications
(169 citation statements)
references
References 52 publications
2
167
0
Order By: Relevance
“…For percolation on graphs it is known that there is a critical probability 0 < p c < 1 such that for p < p c τ (x, y) decays exponentially in the distance |x − y| and for p > p c it does not. This is also related to the occurrence of an infinite connected cluster above p c with probability one, Grimmett (1999).…”
Section: Some Consequences From Finite Volume Criteriamentioning
confidence: 99%
“…For percolation on graphs it is known that there is a critical probability 0 < p c < 1 such that for p < p c τ (x, y) decays exponentially in the distance |x − y| and for p > p c it does not. This is also related to the occurrence of an infinite connected cluster above p c with probability one, Grimmett (1999).…”
Section: Some Consequences From Finite Volume Criteriamentioning
confidence: 99%
“…So let us start with the relevant percolation-type estimates; for background on percolation theory see [15]. Consider site percolation on Z d with P(v open) = q independently for every v ∈ Z d .…”
Section: Dimension Higher Than Onementioning
confidence: 99%
“…For convenience, we assume that the greatest common divisor gcd{k : p k > 0} = 1. The condition ensures that the infinite open cluster is unique (see [5,Theorem 12.3]). If gcd{k : p k > 0} = m > 1 then we consider the bond percolation on mZ 2 with…”
Section: Proofsmentioning
confidence: 99%