First-passage percolation on the square lattice. III
- 1 March 1978
- journal article
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 10 (1) , 155-171
- https://doi.org/10.2307/1426723
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,Lpand (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.Keywords
This publication has 10 references indexed in Scilit:
- First-passage percolation on the square lattice, IIAdvances in Applied Probability, 1977
- First-passage percolation on the square lattice. IAdvances in Applied Probability, 1977
- First-passage percolation on the square lattice, IIAdvances in Applied Probability, 1977
- First-passage percolation on the square lattice. IAdvances in Applied Probability, 1977
- Remarks on renewal theory for percolation processesJournal of Applied Probability, 1976
- Remarks on renewal theory for percolation processesJournal of Applied Probability, 1976
- The Ergodic Theory of Subadditive Stochastic ProcessesJournal of the Royal Statistical Society Series B: Statistical Methodology, 1968
- First-Passage PercolationJournal of the Royal Statistical Society Series B: Statistical Methodology, 1966
- An upper bound for a percolation constantZeitschrift für angewandte Mathematik und Physik, 1965
- Excluded-Volume Problem and the Ising Model of FerromagnetismPhysical Review B, 1959