On martingale tail sums for the path length in random trees
نویسندگان
چکیده
منابع مشابه
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. Mahmoud (1991) showed that Wn := (Tn − E[Tn])/n converges almost surely and in L2 to a nondegenerate limiting random variable W . Here we give recurrence relations for the moments of Wn and of W and show that Wn converg...
متن کاملRandom Gaussian sums on trees
Let T be a tree with induced partial order . We investigate centered Gaussian processes X = (X t)t∈T represented as X t = σ(t) ∑ v t α(v)ξv for given weight functions α and σ on T and with (ξv)v∈T i.i.d. standard normal. In a first part we treat general trees and weights and derive necessary and sufficient conditions for the a.s. boundedness of X in terms of compactness properties of (T, d). He...
متن کاملOn the Complete Convergence ofWeighted Sums for Dependent Random Variables
We study the limiting behavior of weighted sums for negatively associated (NA) random variables. We extend results in Wu (1999) and a theorem in Chow and Lai (1973) for NA random variables.
متن کاملOn the Convergence Rate of the Law of Large Numbers for Sums of Dependent Random Variables
In this paper, we generalize some results of Chandra and Goswami [4] for pairwise negatively dependent random variables (henceforth r.v.’s). Furthermore, we give Baum and Katz’s [1] type results on estimate for the rate of convergence in these laws.
متن کاملON THE EXTERNAL PATH LENGTH OF RANDOM RECURSIVE k-ARY TREES
In this paper, we determine the expectation and variance of Xn the external path length in a random recursive k-ary tree of size n.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 2016
ISSN: 1042-9832
DOI: 10.1002/rsa.20674