### Abstract

Consider the complete graph K_{n} on n vertices and the n-cube graph Q_{n} on 2^{n} 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 | |

Publication status | Published - 2002 Jul 15 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Statistics and Probability
- Statistics, Probability and Uncertainty

### Cite this

*Statistics and Probability Letters*,

*58*(4), 363-368. https://doi.org/10.1016/S0167-7152(02)00144-X

}

*Statistics and Probability Letters*, vol. 58, no. 4, pp. 363-368. https://doi.org/10.1016/S0167-7152(02)00144-X

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

Research output: Contribution to journal › Article

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 -