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

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
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
Mathematics
Identifiers
URN: urn:nbn:se:liu:diva-37666DOI: 10.1002/rsa.20122Local ID: 37246OAI: oai:DiVA.org:liu-37666DiVA: diva2:258515
Note

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: http://dx.doi.org/10.1002/rsa.3240070406

Available from: 2009-10-10 Created: 2009-10-10 Last updated: 2017-12-13

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Wästlund, Johan

Search in DiVA

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

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 281 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf