Polynomial representation for the expected length of minimal spanning trees
Probability
2015-01-16 v1 Combinatorics
Abstract
In this paper, we investigate the polynomial integrand of an integral formula that yields the expected length of the minimal spanning tree of a graph whose edges are uniformly distributed over the interval [0, 1]. In particular, we derive a general formula for the coefficients of the polynomial and apply it to express the first few coefficients in terms of the structure of the underlying graph; e.g. number of vertices, edges and cycles.
Keywords
Cite
@article{arxiv.1501.03758,
title = {Polynomial representation for the expected length of minimal spanning trees},
author = {Jared Nishikawa and Peter T. Otto and Colin Starr},
journal= {arXiv preprint arXiv:1501.03758},
year = {2015}
}
Comments
Published in the PME Journal in 2012