Article contents
First-Passage Percolation with Exponential Times on a Ladder
Published online by Cambridge University Press: 19 March 2010
Abstract
We consider first-passage percolation on a ladder, i.e., the graph ℕ × {0, 1}, where nodes at distance 1 are joined by an edge, and the times are exponentially i.i.d. with mean 1. We find an appropriate Markov chain to calculate an explicit expression for the time constant whose numerical value is ≈0.6827. This time constant is the long-term average inverse speed of the process. We also calculate the average residual time.
- Type
- Paper
- Information
- Copyright
- Copyright © Cambridge University Press 2010
References
- 4
- Cited by