On the Critical Value for ‘Percolation’ of
Minimum-Weight Trees in the Mean-Field Distance Model
1998 ◽
Vol 7
(1)
◽
pp. 1-10
◽
Keyword(s):
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.
2021 ◽
Vol 6
(2)
◽
pp. 1-28
Keyword(s):
2016 ◽
Vol 27
(06)
◽
pp. 1650060
◽
Keyword(s):
2014 ◽
Vol 28
◽
pp. 1460193
Keyword(s):
1997 ◽
Vol 11
(18)
◽
pp. 2183-2193
◽
Keyword(s):
2013 ◽
Vol 2013
◽
pp. 1-6
◽
Keyword(s):