Hostname: page-component-74656f9884-c52kr Total loading time: 0 Render date: 2026-11-09T09:52:27.625Z Has data issue: false hasContentIssue false

First-Passage Percolation with Exponential Times on a Ladder

Published online by Cambridge University Press:  19 March 2010

HENRIK RENLUND*
Affiliation:
Mathematics Department, Uppsala University, PO Box 480, 751 06 Uppsala, Sweden (e-mail: renlund@math.uu.se)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Paper
Copyright
Copyright © Cambridge University Press 2010