Article contents
The Weight and Hopcount of the Shortest Path in the Complete Graph with Exponential Weights
Published online by Cambridge University Press: 01 July 2008
Abstract
Both the hopcount HN (the number of links) and the weight WN (the sum of the weights on links) of the shortest path between two arbitrary nodes in the complete graph KN with i.i.d. exponential link weights is computed. We consider the joint distribution of the pair (HN, WN) and derive, after proper scaling, the joint limiting distribution. One of the results is that HN and WN, properly scaled, are asymptotically independent.
- Type
- Paper
- Information
- Copyright
- Copyright © Cambridge University Press 2008
References
- 4
- Cited by