Sciweavers

2 search results - page 1 / 1
» On sums of independent random variables with unbounded varia...
Sort
View
STOC
2004
ACM
110views Algorithms» more  STOC 2004»
14 years 5 months ago
On sums of independent random variables with unbounded variance, and estimating the average degree in a graph
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...
Uriel Feige
CPC
1999
105views more  CPC 1999»
13 years 4 months ago
Total Path Length For Random Recursive Trees
Total path length, or search cost, for a rooted tree is defined as the sum of all root-to-node distances. Let Tn be the total path length for a random recursive tree of order n. M...
Robert P. Dobrow, James Allen Fill