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.
Volume (Year): 58 (2002)
Issue (Month): 4 (July)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description |
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
When requesting a correction, please mention this item's handle: RePEc:eee:stapro:v:58:y:2002:i:4:p:363-368. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If references are entirely missing, you can add them using this form.