On the Length of a Random Minimum Spanning Tree

Colin Cooper, Alan Frieze, Nate Ince, Svante Janson, Joel Spencer

Research output: Contribution to journal › Article

Abstract

We study the expected value of the length Ln of the minimum spanning tree of the complete graph Kn when each edge e is given an independent uniform [0, 1] edge weight. We sharpen the result of Frieze [6] that lim n→â (Ln) = ζ(3) and show that where c 1, c 2 are explicitly defined constants.

Original languageEnglish (US)
Pages (from-to)89-107
Number of pages19
JournalCombinatorics Probability and Computing
Volume25
Issue number1
DOIs
StatePublished - Jan 1 2016

Fingerprint

Minimum Spanning Tree
Expected Value
Complete Graph

ASJC Scopus subject areas

  • Applied Mathematics
  • Theoretical Computer Science
  • Computational Theory and Mathematics
  • Statistics and Probability

Cite this

On the Length of a Random Minimum Spanning Tree. / Cooper, Colin; Frieze, Alan; Ince, Nate; Janson, Svante; Spencer, Joel.

In: Combinatorics Probability and Computing, Vol. 25, No. 1, 01.01.2016, p. 89-107.

Research output: Contribution to journal › Article

Cooper, C, Frieze, A, Ince, N, Janson, S & Spencer, J 2016, 'On the Length of a Random Minimum Spanning Tree', Combinatorics Probability and Computing, vol. 25, no. 1, pp. 89-107. https://doi.org/10.1017/S0963548315000024
Cooper C, Frieze A, Ince N, Janson S, Spencer J. On the Length of a Random Minimum Spanning Tree. Combinatorics Probability and Computing. 2016 Jan 1;25(1):89-107. https://doi.org/10.1017/S0963548315000024
Cooper, Colin ; Frieze, Alan ; Ince, Nate ; Janson, Svante ; Spencer, Joel. / On the Length of a Random Minimum Spanning Tree. In: Combinatorics Probability and Computing. 2016 ; Vol. 25, No. 1. pp. 89-107.
@article{7b60639b64624813b1cb69a60942c23f,
title = "On the Length of a Random Minimum Spanning Tree",
abstract = "We study the expected value of the length Ln of the minimum spanning tree of the complete graph Kn when each edge e is given an independent uniform [0, 1] edge weight. We sharpen the result of Frieze [6] that lim n→{\^a} (Ln) = ζ(3) and show that where c 1, c 2 are explicitly defined constants.",
author = "Colin Cooper and Alan Frieze and Nate Ince and Svante Janson and Joel Spencer",
year = "2016",
month = "1",
day = "1",
doi = "10.1017/S0963548315000024",
language = "English (US)",
volume = "25",
pages = "89--107",
journal = "Combinatorics Probability and Computing",
issn = "0963-5483",
publisher = "Cambridge University Press",
number = "1",

}

TY - JOUR

T1 - On the Length of a Random Minimum Spanning Tree

AU - Cooper, Colin

AU - Frieze, Alan

AU - Ince, Nate

AU - Janson, Svante

AU - Spencer, Joel

PY - 2016/1/1

Y1 - 2016/1/1

N2 - We study the expected value of the length Ln of the minimum spanning tree of the complete graph Kn when each edge e is given an independent uniform [0, 1] edge weight. We sharpen the result of Frieze [6] that lim n→â (Ln) = ζ(3) and show that where c 1, c 2 are explicitly defined constants.

AB - We study the expected value of the length Ln of the minimum spanning tree of the complete graph Kn when each edge e is given an independent uniform [0, 1] edge weight. We sharpen the result of Frieze [6] that lim n→â (Ln) = ζ(3) and show that where c 1, c 2 are explicitly defined constants.

UR - http://www.scopus.com/inward/record.url?scp=84952980538&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84952980538&partnerID=8YFLogxK

U2 - 10.1017/S0963548315000024

DO - 10.1017/S0963548315000024

M3 - Article

AN - SCOPUS:84952980538

VL - 25

SP - 89

EP - 107

JO - Combinatorics Probability and Computing

JF - Combinatorics Probability and Computing

SN - 0963-5483

IS - 1

ER -

Access to Document