Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-17T01:58:45.445Z Has data issue: false hasContentIssue false

Distribution of Minimal Path Lengths when Edge Lengths are Independent Heterogeneous Exponential Random Variables

Published online by Cambridge University Press:  04 February 2016

Sheldon M. Ross*
Affiliation:
University of Southern California
*
∗ Postal address: Department of Industrial and Systems Engineering, University of Southern California, Los Angeles, CA 90089, USA. Email address: smross@usc.edu
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 find the joint distribution of the lengths of the shortest paths from a specified node to all other nodes in a network in which the edge lengths are assumed to be independent heterogeneous exponential random variables. We also give an efficient way to simulate these lengths that requires only one generated exponential per node, as well as efficient procedures to use the simulated data to estimate quantities of the joint distribution.

Information

Type
Research Article
Copyright
© Applied Probability Trust