First-passage percolation on ladder-like graphs with heterogeneous exponential times
Probability
2011-02-24 v1
Abstract
We determine the asymptotic speed of the first-passage percolation process on some ladder-like graphs (or width-2 stretches) when the times associated with different edges are independent and exponentially distributed but not necessarily all with the same mean. The method uses a particular Markov chain associated with the first-passage percolation process and properties of its stationary distribution.
Keywords
Cite
@article{arxiv.1102.4744,
title = {First-passage percolation on ladder-like graphs with heterogeneous exponential times},
author = {Henrik Renlund},
journal= {arXiv preprint arXiv:1102.4744},
year = {2011}
}