First-passage percolation on ladder-like graphs with inhomogeneous exponential times
From MaRDI portal
Publication:2978465
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.
Recommendations
- First-passage percolation with exponential times on a ladder
- On the Markov transition kernels for first passage percolation on the ladder
- First-passage percolation on width-two stretches with exponential link weights
- First passage percolation on inhomogeneous random graphs
- Asymptotics of First-Passage Percolation on One-Dimensional Graphs
Cited in
(5)- First-passage percolation on width-two stretches with exponential link weights
- First-passage percolation with exponential times on a ladder
- On the Markov transition kernels for first passage percolation on the ladder
- First-passage percolation on a ladder graph, and the path cost in a VCG auction
- Asymptotics of First-Passage Percolation on One-Dimensional Graphs
This page was built for publication: First-passage percolation on ladder-like graphs with inhomogeneous exponential times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2978465)