The branching structure of uniform recursive trees is investigated in this paper.Using the method of sums for a sequence of independent random variables, the distribution law of ηn, the number of branches of the uniform recursive tree of size n are given first. It is shown that the strong law of large numbers, the central limit theorem and the law of iterated logarithm for ηn follow easily from this method. Next it is shown that ηn and ξn, the depth of vertex n, have the same distribution, and the distribution law of ζn,m, the number of branches of size m, is also given, whose asymptotic distribution is the Poisson distribution with parameter λ = 1/m. In addition, the joint distribution and the asymptotic joint distribution of the numbers of various branches are given. Finally, it is proved that the size of the biggest branch tends to infinity almost sure as n -→∞.
For two independent non-negative random variables X and Y, we treat X as the initial variable of major importance and Y as a modifier (such as the interest rate of a portfolio).Stability in the tail behaviors of the product compared with that of the original variable X is of practical interests. In this paper, we study the tail behaviors of the product XY when the distribution of X belongs to the classes L and S, respectively. Under appropriate conditions, we show that the distribution of the product XY is in the same class as X when X belongs to class L or S, in other words, classes L and S are stable under some mild conditions on the distribution of Y. We also show that if the distribution of X is in class L(γ) (γ＞ 0) and continuous, then the product XY is in L if and only if Y is unbounded.
