liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Addendum to The Minimal Spanning Tree in a Complete Graph and a Functional Limit Theorem for Trees in a Random Graph
Department of Mathematics, Uppsala University, Uppsala, Sweden.
Linköping University, Department of Mathematics, Applied Mathematics. Linköping University, The Institute of Technology.
2006 (English)In: Random structures & algorithms (Print), ISSN 1042-9832, E-ISSN 1098-2418, Vol. 28, no 4, 511-512 p.Article in journal (Other academic) Published
Abstract [en]

The minimal weight of a spanning tree in a complete graph Kn with independent, uniformly distributed random weights on the edges is shown to have an asymptotic normal distribution. The proof uses a functional limit extension of results by Barbour and Pittel on the distribution of the number of tree components of given sizes in a random graph.

Place, publisher, year, edition, pages
2006. Vol. 28, no 4, 511-512 p.
National Category
URN: urn:nbn:se:liu:diva-37666DOI: 10.1002/rsa.20122Local ID: 37246OAI: diva2:258515

Article Addendum to: Svane Janson (1995), The minimal spanning tree in a complete graph and a functional limit theorem for trees in a random graph, Random Structures Algorithms, Volume 7, Issue 4, pages 337–355; MR1369071. DOI:

Available from: 2009-10-10 Created: 2009-10-10 Last updated: 2015-10-09

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Wästlund, Johan
By organisation
Applied MathematicsThe Institute of Technology
In the same journal
Random structures & algorithms (Print)

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 273 hits
ReferencesLink to record
Permanent link

Direct link