Minimal Spanning Trees for Graphs with Random Edge Lengths
The theory of the minimal spanning tree (MST) of a connected graph whose edges are assigned lengths according to independent identically distributed random variables is developed from two directions. First, it is shown how the Tutte polynomial for a connected graph can be used to provide an exact formula for the length of the minimal spanning tree under the model of uniformly distributed edge lengths. Second, it is shown how the theory of local weak convergence provides a systematic approach to the asymptotic theory of the length of the MST and related power sums. Consequences of these investigations include (1) the exact rational determination of the expected length of the MST for the complete graph Kn for 2 ≤ n ≤ 9 and (2) refinements of the results of Penrose (1998) for the MST of the d-cube and results of Beveridge, Frieze, and McDiarmid (1998) and Frieze, Ruzink6, and Thoma (2000) for graphs with modest expansion properties. In most cases, the results reviewed here have not reached their final form, and they should be viewed as part of work-in-progress.
KeywordsPoisson Process Connected Graph Edge Length Minimal Span Tree Geometric Graph
Unable to display preview. Download preview PDF.
- D.J. Aldous and J.M. Steele (2002) The Objective Method and the Theory of Local Weak Convergence in Discrete and Combinatorial Probability (ed. H. Kesten), Springer-Verlag, New York. [in press]Google Scholar
- N. Alon, A. Frieze, and D. Welsh (1994) Polynomial time randomized approximation schemes for the Tutte polynomial of dense graphs pp. 24–35 in the Proceedings of the 35th Annual Symposium on the Foundations of Computer Science (S. Goldwasser, ed.), IEEE Computer Society Press, 1994.Google Scholar
- A. M. Frieze, M. Ruszinkó, and L. Thoma (2000) A note on random minimum lenght spanning trees Electronic Journal of Combinatorics 7, Research Paper 5, (5 pp.)Google Scholar
- I.M. Gessel and B.E. Sagan (1996) The Tutte polynomial of a graph depth-first search and simpicial complex partitions Electronic Journal of Combinatorics 3, Reseach Paper 9, (36 pp.)Google Scholar
- T.H. Harris (1989) The Theory of Branching Processes Dover Publications, New York.Google Scholar
- G. Parisi (1998) A conjecture on radon’ bipartite matching ArXiv Condmat 980–1176.Google Scholar