Abstract
We consider the complete graph $\cK_n$ on vertices with exponential mean edge lengths. Writing for the weight of the smallest-weight path between vertex , Janson showed that converges in probability to 3. We extend this result by showing that converges in distribution to a limiting random variable that can be identified via a maximization procedure on a limiting infinite random structure. Interestingly, this limiting random variable has also appeared as the weak limit of the re-centered graph diameter of the barely supercritical Erdős-Rényi random graph in work by Riordan and Wormald.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.