1997
DOI: 10.1007/s004400050080
|View full text |Cite
|
Sign up to set email alerts
|

A central limit theorem for “critical” first-passage percolation in two dimensions

Abstract: Consider (independent) ÿrst-passage percolation on the edges of Z 2 . Denote the passage time of the edge e in Z 2 by t(e), and assume that P{t(e) = 0} = 1=2, P{0 ¡t(e)¡C 0 } = 0 for some constant C 0 ¿ 0 and that E[t (e)] ¡ ∞ for some ¿4. Denote by b 0; n the passage time from 0 to the halfplane {(x; y): x = n}, and by T (0; nu) the passage time from 0 to the nearest lattice point to nu, for u a unit vector. We prove that there exist constants 0 ¡C 1 , C 2 ¡∞ and n such that C 1 (log n) 1=2 5 n 5 C 2 (log n) … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

3
72
0

Year Published

1997
1997
2019
2019

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 43 publications
(75 citation statements)
references
References 13 publications
3
72
0
Order By: Relevance
“…Denote by b0,n the passage time from 0 to the halfplane {v ∈ T : Re(v) ≥ n}, and by T (0, nu) the passage time from 0 to the nearest site to nu, where |u| = 1. We prove that as n → ∞, b0,n/ log n →This answers a question of Kesten and Zhang (1997) and improves our previous work (2014). From this result, we derive an explicit form of the central limit theorem for b0,n and T (0, nu).…”
supporting
confidence: 88%
“…Denote by b0,n the passage time from 0 to the halfplane {v ∈ T : Re(v) ≥ n}, and by T (0, nu) the passage time from 0 to the nearest site to nu, where |u| = 1. We prove that as n → ∞, b0,n/ log n →This answers a question of Kesten and Zhang (1997) and improves our previous work (2014). From this result, we derive an explicit form of the central limit theorem for b0,n and T (0, nu).…”
supporting
confidence: 88%
“…Let us mention that it is possible to use the SLE techniques in Section 4.3 of [6] to give a third proof. In order to prove the limit result for Var(c + n ), we use a martingale method from [12]. The organization of the paper is as follows.…”
Section: Remarkmentioning
confidence: 99%
“…Proof of (55). The proof is essentially the same as the proof of (2.24) in [14]. Recall that for j ≥ 0, ∆ j (ω) := E p [T (0, ∂B(L(p))) | F j ] − E p [T (0, ∂B(L(p))) | F j−1 ].…”
Section: Appendix: Proof Of (55)mentioning
confidence: 88%
“…We now wish to bound the second term on the right-hand side of (32). We will use the martingale method introduced in [14]. This approach has been used in [8,27] also.…”
Section: Then We Havementioning
confidence: 99%
See 1 more Smart Citation