Abstract
Consider the complete n-graph with independent exponential
(mean n)
edge-weights. Let M(c, n) be the maximal size
of subtree for which the
average edge-weight is at most c. It is
shown that M(c, n) makes the transition from
o(n) to
Ω(n) around some critical value c(0),
which can be specified in terms of a fixed point of a mapping on probability
distributions.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献