The weight of the shortest path tree

Authors:
Remco van der Hofstad;Gerard Hooghiemstra;Piet Van Mieghem
Affiliations:
Department of Mathematics and Computer Science, Eindhoven University of Technology, P. O. Box 513, 5600 MB Eindhoven, The Netherlands;Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, P.O. Box 5031, 2600 GA Delft, The Netherlands;Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, P.O. Box 5031, 2600 GA Delft, The Netherlands
Venue:
Random Structures & Algorithms
Year:
2007

Citing 4
Cited 2

The minimal spanning tree in a complete graph and a functional limit theorem for trees in a random graph

Random Structures & Algorithms
Constructive bounds and exact expectation for the random assignment problem

Random Structures & Algorithms
FIRST-PASSAGE PERCOLATION ON THE RANDOM GRAPH

Probability in the Engineering and Informational Sciences
Size and Weight of Shortest Path Trees with Exponential Link Weights

Combinatorics, Probability and Computing

Addendum to “The Minimal Spanning Tree in a Complete Graph and a Functional Limit Theorem for Trees in a Random Graph”

Random Structures & Algorithms
The longest minimum-weight path in a complete graph

Combinatorics, Probability and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We derive several limit results for the profile of random plane-oriented recursive trees. These include the limit distribution of the normalized profile, asymptotic bimodality of the variance, asymptotic approximation to the expected width, and the correlation ...