Cover Image

Gaussian tail for empirical distributions of MST on random graphs

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 and 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 and with weight at most t/n.
Year of publication:
2002
Authors: Lee, Sungchul ; Su, Zhonggen
Published in:
Statistics & Probability Letters. - Elsevier, ISSN 0167-7152. - Vol. 58.2002, 4, p. 363-368
Publisher: Elsevier
Keywords: Empirical distribution Gaussian tail Minimal spanning tree
Type of publication: Article
Source:
Persistent link: https://www.econbiz.de/10005138394
Similar items by person