Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Home
  • Home
EnglishFrançais
Combinatorics, Probability and Computing Combinatorics, Probability and Computing

Article contents

On the Difference of Expected Lengths of Minimum Spanning Trees

Published online by Cambridge University Press:  01 May 2009

WENBO V. LI  and
XINYI ZHANG
WENBO V. LI
Affiliation:
Department of Mathematical Sciences, University of Delaware, Newark DE 19716, USA (e-mail: wli@math.udel.edu, xzhang@math.udel.edu)
XINYI ZHANG
Affiliation:
Department of Mathematical Sciences, University of Delaware, Newark DE 19716, USA (e-mail: wli@math.udel.edu, xzhang@math.udel.edu)
Corresponding
E-mail address:
wli@math.udel.edu
xzhang@math.udel.edu
Get access
Rights & Permissions[Opens in a new window]

Abstract

An exact formula for the expected length of the minimum spanning tree of a connected graph, with independent and identical edge distribution, is given, which generalizes Steele's formula in the uniform case. For a complete graph, the difference of expected lengths between exponential distribution, with rate one, and uniform distribution on the interval (0, 1) is shown to be positive and of rate ζ(3)/n. For wheel graphs, precise values of expected lengths are given via calculations of the associated Tutte polynomials.

Type
Paper
Information
Combinatorics, Probability and Computing , Volume 18 , Issue 3 , May 2009 , pp. 423 - 434
Copyright
Copyright © Cambridge University Press 2008

Access options

Get access to the full version of this content by using one of the access options below.
If you should have access and can't see this content please contact technical support.

References

[1]Avram, F. and Bertsimas, D. (1992) The minimum spanning tree constant in geometric probability and under the independent model: A unified approach. Ann. Appl. Probab. 2 113–130.CrossRefGoogle Scholar
[2]Benedict, C. P. (1969) On self-dualisms in graphs and networks. PhD dissertation, University of Waterloo, Waterloo, Ontario, Canada.Google Scholar
[3]Benjamin, A. T. and Yerger, C. R. (2006) Combinatorial interpretations of spanning tree identities. Bull. Inst. Combin. Appl. 47 37–42.Google Scholar
[4]Beveridge, A., Frieze, A. and McDiarmid, C. (1998) Minimum length spanning trees in regular graphs. Combinatorica 18 311–333.CrossRefGoogle Scholar
[5]Bollobás, B. (2001) Random Graphs, 2nd edn, Cambridge University Press.CrossRefGoogle Scholar
[6]Bollobás, B. (2002) Modern Graph Theory, Springer.Google Scholar
[7]Cayley, A. (1889) A theorem on trees. Quart. J. Pure Appl. Math. 23 376–378.Google Scholar
[8]Fill, J. A. and Steele, J. M. (2005) Exact expectations of minimal spanning trees for graphs with random edge weights. Stein's method and applications, Lect. Notes Ser. Inst. Math. Sci. Natl. Univ. Singap., Singapore University Press, Singapore, 5169–180.Google Scholar
[9]Flaxman, A. D. (2007) The lower tail of the random minimum spanning tree. Electron. J. Combin. 14 #3.Google Scholar
[10]Frieze, A. M. (1985) On the value of a random minimum spanning tree problem. Discrete Appl. Math. 10 47–56.CrossRefGoogle Scholar
[11]Frieze, A. M. and McDiarmid, C. J. H. (1989) On random minimum length spanning trees. Combinatorica 9 363–374.CrossRefGoogle Scholar
[12]Frieze, A. M., Ruszinkó, M. and Thoma, L. (2000) A note on random minimum length spanning trees. Electron. J. Combin. 7 #5.Google Scholar
[13]Gamarnik, D. (2005) The expected value of random minimal length spanning tree of a complete graph. In Proc. 16th Annual ACM–SIAM Symposium on Discrete Algorithms, pp. 700–704.Google Scholar
[14]Hutson, K. and Lewis, T. M. (2007) The expected length of a minimum spanning tree of a cylinder graph. Combin. Probab. Comput. 16 63–83.CrossRefGoogle Scholar
[15]Janson, S. (1993) Multicyclic components in a random graph process. Random Struct. Alg. 4 71–84.CrossRefGoogle Scholar
[16]Janson, S. (1995) The minimal spanning tree in a complete graph and a functional limit theorem for trees in a random graph. Random Struct. Alg. 7 337–355.CrossRefGoogle Scholar
[17]McDiarmid, C. (1989) On the method of bounded differences. In Surveys in Combinatorics, Vol. 141 of London Mathematical Society Lecture Note Series, Cambridge University Press, pp. 148–188.Google Scholar
[18]Myers, B. R. (1971) Number of spanning trees in a wheel. IEEE Trans. Circuit Theory CT-18 280–282.CrossRefGoogle Scholar
[19]Penrose, M. (1998) Random minimum spanning tree and percolation on the n-cube. Random Struct. Alg. 12 63–82.3.0.CO;2-R>CrossRefGoogle Scholar
[20]Sedlacek, J. (1970) On the skeletons of a graph or digraph. In Proc. Calgary International Conference on Combinatorial Structures and their Applications, Gordon and Breach, pp. 387–391.Google Scholar
[21]Smith, C. A. B. and Tutte, W. T. (1950) A class of self-dual maps. Canad. J. Math. 2 179–196.CrossRefGoogle Scholar
[22]Steele, J. M. (1987) On Frieze's ζ(3) limit for lengths of minimal spanning trees. Discrete Appl. Math. 18 99–103.CrossRefGoogle Scholar
[23]Steele, J. M. (2002) Minimum spanning trees for graphs with random edge lengths. In Mathematics and Computer Science II: Algorithms, Trees, Combinatorics and Probabilities, Birkhäuser, pp. 223–245.CrossRefGoogle Scholar
[24]Tutte, W. T. (1950) Squaring the square. Canad. J. Math. 2 197–209.CrossRefGoogle Scholar
[25]Welsh, D. (1999) The Tutte polynomial. Random Struct. Alg. 15 210–228.3.0.CO;2-R>CrossRefGoogle Scholar

Full text views

Full text views reflects PDF downloads, PDFs sent to Google Drive, Dropbox and Kindle and HTML full text views.

Total number of HTML views: 0
Total number of PDF views: 33 *
View data table for this chart

* Views captured on Cambridge Core between September 2016 - 4th December 2020. This data will be updated every 24 hours.

1 Cited by
Hostname: page-component-b4dcdd7-nf2kx Total loading time: 0.402 Render date: 2020-12-04T15:30:14.390Z Query parameters: { "hasAccess": "0", "openAccess": "0", "isLogged": "0", "lang": "en" } Feature Flags last update: Fri Dec 04 2020 15:00:28 GMT+0000 (Coordinated Universal Time) Feature Flags: { "metrics": true, "metricsAbstractViews": false, "peerReview": true, "crossMark": true, "comments": true, "relatedCommentaries": true, "subject": true, "clr": false, "languageSwitch": true }

Send article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

On the Difference of Expected Lengths of Minimum Spanning Trees
Available formats
×

Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

On the Difference of Expected Lengths of Minimum Spanning Trees
Available formats
×

Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

On the Difference of Expected Lengths of Minimum Spanning Trees
Available formats
×
×

Reply to: Submit a response

Your details

Conflicting interests

Do you have any conflicting interests? *