Gaussian tail for empirical distributions of MST on random graphs

Sungchul Lee; Zhonggen Su

doi:10.1016/S0167-7152(02)00144-X

Gaussian tail for empirical distributions of MST on random graphs

Sungchul Lee, Zhonggen Su

Department of Mathematics

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

Abstract

Consider the complete graph K_n on n vertices and the n-cube graph Q_n on 2ⁿ vertices. Suppose independent uniform random edge weights are assigned to each edges in K_n and Q_n and let T (K_n) and T (Q_n) denote the unique minimal spanning trees on K_n and Q_n, respectively. In this paper we obtain the Gaussian tail for the number of edges of T (K_n) and T (Q_n) with weight at most t/n.

Original language	English
Pages (from-to)	363-368
Number of pages	6
Journal	Statistics and Probability Letters
Volume	58
Issue number	4
DOIs	https://doi.org/10.1016/S0167-7152(02)00144-X
Publication status	Published - 2002 Jul 15

All Science Journal Classification (ASJC) codes

Statistics and Probability
Statistics, Probability and Uncertainty

Access to Document

10.1016/S0167-7152(02)00144-X

Cite this

@article{4593f369e81b44ca9e5580ef2941ea77,

title = "Gaussian tail for empirical distributions of MST on random graphs",

abstract = "Consider the complete graph Kn on n vertices and the n-cube graph Qn on 2n vertices. Suppose independent uniform random edge weights are assigned to each edges in Kn and Qn and let T (Kn) and T (Qn) denote the unique minimal spanning trees on Kn and Qn, respectively. In this paper we obtain the Gaussian tail for the number of edges of T (Kn) and T (Qn) with weight at most t/n.",

author = "Sungchul Lee and Zhonggen Su",

year = "2002",

month = jul,

day = "15",

doi = "10.1016/S0167-7152(02)00144-X",

language = "English",

volume = "58",

pages = "363--368",

journal = "Statistics and Probability Letters",

issn = "0167-7152",

publisher = "Elsevier",

number = "4",

}

TY - JOUR

T1 - Gaussian tail for empirical distributions of MST on random graphs

AU - Lee, Sungchul

AU - Su, Zhonggen

PY - 2002/7/15

Y1 - 2002/7/15

N2 - Consider the complete graph Kn on n vertices and the n-cube graph Qn on 2n vertices. Suppose independent uniform random edge weights are assigned to each edges in Kn and Qn and let T (Kn) and T (Qn) denote the unique minimal spanning trees on Kn and Qn, respectively. In this paper we obtain the Gaussian tail for the number of edges of T (Kn) and T (Qn) with weight at most t/n.

AB - Consider the complete graph Kn on n vertices and the n-cube graph Qn on 2n vertices. Suppose independent uniform random edge weights are assigned to each edges in Kn and Qn and let T (Kn) and T (Qn) denote the unique minimal spanning trees on Kn and Qn, respectively. In this paper we obtain the Gaussian tail for the number of edges of T (Kn) and T (Qn) with weight at most t/n.

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

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

U2 - 10.1016/S0167-7152(02)00144-X

DO - 10.1016/S0167-7152(02)00144-X

M3 - Article

AN - SCOPUS:0037100723

SN - 0167-7152

VL - 58

SP - 363

EP - 368

JO - Statistics and Probability Letters

JF - Statistics and Probability Letters

IS - 4

ER -

Gaussian tail for empirical distributions of MST on random graphs

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this