First-passage percolation with exponential times on a ladder

From MaRDI portal
Publication:4933602

DOI10.1017/S0963548310000052zbMATH Open1202.60158arXiv1002.3709MaRDI QIDQ4933602FDOQ4933602


Authors: Henrik Renlund Edit this on Wikidata


Publication date: 14 October 2010

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Abstract: We consider first-passage percolation on a ladder, i.e. the graph {0,1,...}*{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 approximately 0.6827. This time constant is the long-term average inverse speed of the process. We also calculate the average residual time.


Full work available at URL: https://arxiv.org/abs/1002.3709




Recommendations




Cites Work


Cited In (4)





This page was built for publication: First-passage percolation with exponential times on a ladder

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4933602)