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.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
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: (Shamier, Wendy)
If references are entirely missing, you can add them using this form.