Rate of convergence in first-passage percolation under low moments

Abstract: We consider first-passage percolation on the

d

dimensional cubic lattice for

d g e q 2

; that is, we assign independently to each edge

e

a nonnegative random weight

t_{e}

with a common distribution and consider the induced random graph distance (the passage time),

T (x, y)

. It is known that for each

x i n m a t h b b Z^{d}

,

m u (x) = l i m_{n} T (0, n x) / n

exists and that

0 l e q m a t h b b E T (0, x) - m u (x) l e q C | x |_{1}^{1 / 2} l o g | x |_{1}

under the condition

m a t h b b E e^{a l p h a t_{e}} < i n f t y

for some

a l p h a > 0

. By combining tools from concentration of measure with Alexander's methods, we show how such bounds can be extended to

t_{e}

's with distributions that have only low moments. For such edge-weights, we obtain an improved bound

C (| x |_{1} l o g | x |_{1})^{1 / 2}

and bounds on the rate of convergence to the limit shape.

Recommendations

Cites Work

Cited In (13)

This page was built for publication: Rate of convergence in first-passage percolation under low moments