The weight of the shortest path tree

R.W. Hofstad, van der; G. Hooghiemstra; P. Van Mieghem

doi:10.1002/rsa.20141

The weight of the shortest path tree

R.W. Hofstad, van der
, G. Hooghiemstra
, P. Van Mieghem

Statistics

Research output: Contribution to journal › Article › Academic › peer-review

5 Citations (Scopus)

Abstract

The minimal weight of the shortest path tree in a complete graph with independent and exponential (mean 1) random link weights is shown to converge to a Gaussian distribution. We prove a conditional central limit theorem and show that the condition holds with probability converging to 1.

Original language	English
Pages (from-to)	359-379
Journal	Random Structures and Algorithms
Volume	30
Issue number	3
DOIs	https://doi.org/10.1002/rsa.20141
Publication status	Published - 2007

Access to Document

10.1002/rsa.20141

Cite this

@article{422ad15385a24b15be72c429108b6b7c,

title = "The weight of the shortest path tree",

abstract = "The minimal weight of the shortest path tree in a complete graph with independent and exponential (mean 1) random link weights is shown to converge to a Gaussian distribution. We prove a conditional central limit theorem and show that the condition holds with probability converging to 1.",

author = "\{Hofstad, van der\}, R.W. and G. Hooghiemstra and \{Van Mieghem\}, P.",

year = "2007",

doi = "10.1002/rsa.20141",

language = "English",

volume = "30",

pages = "359--379",

journal = "Random Structures and Algorithms",

issn = "1042-9832",

publisher = "Wiley",

number = "3",

}

TY - JOUR

T1 - The weight of the shortest path tree

AU - Hofstad, van der, R.W.

AU - Hooghiemstra, G.

AU - Van Mieghem, P.

PY - 2007

Y1 - 2007

N2 - The minimal weight of the shortest path tree in a complete graph with independent and exponential (mean 1) random link weights is shown to converge to a Gaussian distribution. We prove a conditional central limit theorem and show that the condition holds with probability converging to 1.

AB - The minimal weight of the shortest path tree in a complete graph with independent and exponential (mean 1) random link weights is shown to converge to a Gaussian distribution. We prove a conditional central limit theorem and show that the condition holds with probability converging to 1.

U2 - 10.1002/rsa.20141

DO - 10.1002/rsa.20141

M3 - Article

SN - 1042-9832

VL - 30

SP - 359

EP - 379

JO - Random Structures and Algorithms

JF - Random Structures and Algorithms

IS - 3

ER -

The weight of the shortest path tree

Abstract

Access to Document

Fingerprint

Cite this