English

Asymptotics for $2D$ Critical First Passage Percolation

Probability 2015-08-18 v2

Abstract

We consider first-passage percolation on Z2\mathbb{Z}^2 with i.i.d. weights, whose distribution function satisfies F(0)=pc=1/2F(0) = p_c = 1/2. This is sometimes known as the "critical case" because large clusters of zero-weight edges force passage times to grow at most logarithmically, giving zero time constant. Denote T(0,B(n))T(\mathbf{0}, \partial B(n)) as the passage time from the origin to the boundary of the box [n,n]×[n,n][-n,n] \times [-n,n]. We characterize the limit behavior of T(0,B(n))T(\mathbf{0}, \partial B(n)) by conditions on the distribution function FF. We also give exact conditions under which T(0,B(n))T(\mathbf{0}, \partial B(n)) will have uniformly bounded mean or variance. These results answer several questions of Kesten and Zhang from the '90s and, in particular, disprove a conjecture of Zhang from '99. In the case when both the mean and the variance go to infinity as nn \to \infty, we prove a CLT under a minimal moment assumption. The main tool involves a new relation between first-passage percolation and invasion percolation: up to a constant factor, the passage time in critical first-passage percolation has the same first-order behavior as the passage time of an optimal path constrained to lie in an embedded invasion cluster.

Keywords

Cite

@article{arxiv.1505.07544,
  title  = {Asymptotics for $2D$ Critical First Passage Percolation},
  author = {Michael Damron and Wai-Kit Lam and Xuan Wang},
  journal= {arXiv preprint arXiv:1505.07544},
  year   = {2015}
}

Comments

28 pages, 2 figures

R2 v1 2026-06-22T09:42:50.203Z