First-passage percolation on the square lattice. III
Keyword(s):
The principal results of this paper concern the asymptotic behavior of the number of arcs in the optimal routes of first-passage percolation processes on the square lattice. Assuming that the underlying distribution has an atom at zero less than λ–1, where λ is the connectivity constant, Lp and (in some cases) almost sure convergence theorems are proved for the normalized route length processes. The proofs involve the extension of much of the existing theory of first-passage percolation to the case where negative time coordinates are permitted.
1978 ◽
Vol 10
(01)
◽
pp. 155-171
◽
1977 ◽
Vol 9
(01)
◽
pp. 38-54
◽
1976 ◽
Vol 13
(02)
◽
pp. 290-300
◽
1980 ◽
Vol 12
(04)
◽
pp. 864-879
◽
2011 ◽
Vol 48
(02)
◽
pp. 366-388
◽