Superlinearity of geodesic length in 2D critical first-passage percolation

Abstract: First-passage percolation is the study of the metric space

(m a t h b b Z^{d}, T)

, where

T

is a random metric defined as the weighted graph metric using random edge-weights

(t_{e})_{e i n m a t h c a l E^{d}}

assigned to the nearest-neighbor edges

m a t h c a l E^{d}

of the

d

-dimensional cubic lattice. We study the so-called critical case in two dimensions, in which

m a t h b b P (t_{e} = 0) = p_{c}

, where

p_{c}

is the threshold for two-dimensional bond percolation. In contrast to the standard case

(< p_{c})

, the distance

T (0, x)

in the critical case grows sub linearly in

x

and geodesics are expected to have Euclidean length which is superlinear. We show a strong version of this super linearity, namely that there is

s > 1

such that with probability at least

1 - e^{- | x |_{1}^{c}}

, the minimal length geodesic from

0

to

x

has at least

| x |_{1}^{s}

number of edges. Our proofs combine recent ideas to bound

T

for general critical distributions, and modifications of techniques of Aizenman-Burchard to estimate the Hausdorff dimension of random curves.

Recommendations

Cites work

Cited in

(10)

This page was built for publication: Superlinearity of geodesic length in 2D critical first-passage percolation