On the Length of a Random Minimum Spanning Tree.
COMBINATORICS PROBABILITY & COMPUTING(2016)
摘要
We study the expected value of the length L-n of the minimum spanning tree of the complete graph K-n when each edge e is given an independent uniform [0, 1] edge weight. We sharpen the result of Frieze [6] that lim(n ->infinity) E(L-n) = zeta(3) and show that E(L-n) = zeta(3) + c(1)/n + c(2) + o(1)/n4/3, where c(1), c(2) are explicitly defined constants.
更多查看译文
关键词
random minimum spanning tree,length
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络