Random Minimum Spanning Tree and Dense Graph Limits
Abstract
ABSTRACT A theorem of Frieze from 1985 asserts that the total length of the minimum spanning tree of the complete graph whose edges get independent lengths from the distribution converges to Apéry's constant in probability, as . We generalize this result to sequences of graphs that converge to a graphon . Further, we allow the lengths of the edges to be drawn from different distributions (subject to moderate conditions). The limiting total length of the minimum spanning tree is expressed in terms of a certain branching process defined on , which was studied previously by Bollobás, Janson and Riordan in connection with the giant component in inhomogeneous random graphs.
Fields of Study & Subjects
Stochastic processes and statistical mechanics
Markov Chains and Monte Carlo Methods
Limits and Structures in Graph Theory
Publication details
- Journal / source
- Random Structures and Algorithms
- Publisher
- Wiley
- Volume
- 68
- Issue
- 2
- Publication date
- 17 February 2026
- Language
- EN