Print Email Facebook Twitter The Weight and Hopcount of the Shortest Path in the Complete Graph with Exponential Weights Title The Weight and Hopcount of the Shortest Path in the Complete Graph with Exponential Weights Author Hooghiemstra, G. Van Mieghem, P. Faculty Electrical Engineering, Mathematics and Computer Science Department Delft Institute of Applied Mathematics 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. To reference this document use: http://resolver.tudelft.nl/uuid:38000643-750e-47b7-be12-1198ec77e1b7 Publisher Cambridge University Press ISSN 0963-5483 Source Combinatorics, Probability and Computing, Vol. 17, No. 4, 2008 Part of collection Institutional Repository Document type journal article Rights (c) 2008 Hooghiemstra, G.; Van Mieghem, P. Files PDF CPCweightandhop.pdf 150.05 KB Close viewer /islandora/object/uuid:38000643-750e-47b7-be12-1198ec77e1b7/datastream/OBJ/view