Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-15T10:45:06.049Z Has data issue: false hasContentIssue false

First-passage percolation on the square lattice. III

Published online by Cambridge University Press:  01 July 2016

R. T. Smythe
Affiliation:
University of Oregon
John C. Wierman
Affiliation:
University of Minnesota

Abstract

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.

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 1978 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable