Gaussian tail for empirical distributions of MST on random graphs

Sung chul Lee, Zhonggen Su

Research output: Contribution to journalArticle

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.

Original languageEnglish
Pages (from-to)363-368
Number of pages6
JournalStatistics and Probability Letters
Volume58
Issue number4
DOIs
Publication statusPublished - 2002 Jul 15

Fingerprint

Empirical Distribution
Minimum Spanning Tree
Random Graphs
Tail
Minimal Spanning Tree
N-cube
Complete Graph
Denote
Graph in graph theory
Empirical distribution
Random graphs
Minimum spanning tree
Graph
Spanning tree

All Science Journal Classification (ASJC) codes

  • Statistics and Probability
  • Statistics, Probability and Uncertainty

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 = "Lee, {Sung chul} and Zhonggen Su",
year = "2002",
month = "7",
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",

}

Gaussian tail for empirical distributions of MST on random graphs. / Lee, Sung chul; Su, Zhonggen.

In: Statistics and Probability Letters, Vol. 58, No. 4, 15.07.2002, p. 363-368.

Research output: Contribution to journalArticle

TY - JOUR

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

AU - Lee, Sung chul

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

VL - 58

SP - 363

EP - 368

JO - Statistics and Probability Letters

JF - Statistics and Probability Letters

SN - 0167-7152

IS - 4

ER -