Abstract
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 \(\lambda = \frac{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 → ∞.
Article PDF
Similar content being viewed by others
References
Xu, J. M., Graph Theory and its Applications, Hefei: Press of University of Science and Technology of China, 1998.
Bergeron, F., Flajolet, P., Salvy, B., Varieties of increasing trees, in Proc.17th Coll. Trees in Algebra and Programming (Lecture Notes Comput. Sci. 581), Berlin: Springer, 1992, 24–48.
Moon, J. W., The distance between nodes in recursive trees, in London Mathematics Society Lecture Notes Series, London: Cambridge University Press, 1974, 13: 125–132.
Najock, D., Heyde, C., On the number of the terminal vertices in certain random trees with an applications to stemma construction in philology, J. Appl. Prob., 1982, 19: 675–680.
Gastwirth, J., A probability model of a pyramid scheme, Amer. Statist., 1977, 31: 79–82.
Meir, A., Moon, J. W., On the altitude of nodes in random trees, Canad. J. Math., 1978, 30: 997–1015.
Szymański, J., On the maximum degree and the height of a random recursive tree, Random Graphs’87 (eds. Karoński M., Ruciński A.), North-Holland: John Wiley & Sons, 1990, 313–324.
Devroye, L., Applications of the theory of records in the study of random trees, Acta Informatica, 1988, 26: 123–130.
Mahmoud, H. M., Distances in random plane-orients recursive trees, J. Comput. Appl. Math., 1992, 41: 237–245.
Mahmoud, H. M., Limiting distributions for path lengths in recursive trees, Probab. Engrg. Inform. Sci., 1991, 5: 53–59.
Petrov, V. V., Limit Theorems of Probability Theory, Oxford: Clarendon Press, 1995.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Feng, Q., Su, C. & Hu, Z. Branching structure of uniform recursive trees. Sci. China Ser. A-Math. 48, 769–784 (2005). https://doi.org/10.1360/03ys0299
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1360/03ys0299