Expected Lengths of Minimum Spanning Trees for Non-identical Edge Distributions
Wenbo V. Li, University of Delaware
Xinyi Zhang, FHCRC
Abstract
An exact general formula for the expected length of the minimal spanning tree (MST) of a connected (possibly with loops and multiple edges) graph whose edges are assigned lengths according to independent (not necessarily identical) distributed random variables is developed in terms of the multivariate Tutte polynomial (alias Potts model). Our work was inspired by Steele's formula based on two-variable Tutte polynomial under the model of
uniformly identically distributed edge lengths. Applications to wheel graphs and cylinder graphs are given under two types of edge distributions.
Full text: PDF
Copyright for articles published in this journal is retained by the authors, with first publication rights granted to the journal. By virtue of their appearance in this open access journal, articles are free to use, with proper attribution, in educational and other non-commercial settings.
The authors of papers published in EJP/ECP retain the copyright. We ask for the permission to use the material in any form. We also require that the initial publication in EJP or ECP is acknowledged in any future publication of the same article.
Before a paper is published in the Electronic Journal of Probability or Electronic Communications in Probability we must receive a hard-copy of the copyright form. Please mail it to
Philippe Carmona
Laboratoire Jean Leray UMR 6629
Universite de Nantes,
2, Rue de la Houssinière BP 92208
F-44322 Nantes Cédex 03
France
You can also send it by FAX: (33|0) 2 51 12 59 12 to the attention of Philippe Carmona. You can even send a scanned jpeg or pdf of this copyright form to the managing editor ejpecpme@math.univ-nantes.fr. as an attached file.
If a paper has several authors, the corresponding author signs the copyright form on behalf of all the authors.