Font Size: a A A

Limit Theorems For Some Random Variables In Random Trees

Posted on:2009-05-16Degree:DoctorType:Dissertation
Country:ChinaCandidate:J LiuFull Text:PDF
GTID:1100360242495847Subject:Probability theory and mathematical statistics
Abstract/Summary:PDF Full Text Request
In this dissertation, the limiting behaviors of some random variables in several kinds of random trees such as random binary search tree, random recursive tree and binary interval tree are established.There are totally three types of different nodes in random binary search trees, i.e. the nodes with 0, 1, and 2 children. Let Xn, Xn(1) and Xn(2) be the numbers of these three types of nodes in random search trees of size n, respectively. First, we build the recursive function for the number of leaves Xn, from which the expectation and variance of Xn are drawn after careful calculation. Then, it is also shown that Xn is asymptotically normal as n→∞by applying the contraction method. Finally, a linear relationship between Xn and Xn is found, and the similar results for Xn(1) and Xn(2) are achieved.For arbitrary positive integer i=in≤n-1, a function of n, we demonstrate D(in),n, the distance between nodes in and n in random recursive trees of size n. Many authors have already discussed this topic and have gotten some properties of D(in),n for some special cases of in. For example, they ha,ve given the exact expression of the expectation and variance of D(in),n, and have divided D(in),n into the sum of some independent random variables. With the help of their conclusions, we apply the normal approximation method to solve the most general situation of D(in),n without any restriction on in, and show that D(in),n is asymptotically normal as n→∞. By the way, the Large Number Law of D(in),n is also got.Binary interval trees are generated from the process of random divisions of interval (0, x). The limiting distribution of Sx, the size of binary interval tree, is investigated. First, we construct the probability space of binary interval trees, and prove the Large Number Law of Sx. Then, the distributional recursive equation of Sx is built. Following this recursive function, the calculation of the expectation and variance of Sx could be transformed into the problem of solving first-order ordinary differential equations and the exact solution are achieved. At last, it is shown that the Sx with suitable standardization converges in distribution to the standard normal random variable according to the contraction method in continuous case.
Keywords/Search Tags:Random binary search tree, random recursive tree, binary interval tree, node, size, contraction method, Zolotarev metric
PDF Full Text Request
Related items