Abstract
We study the fringe of random recursive trees, by analyzing the joint distribution of the counts of uncorrelated motifs. Our approach allows for finite and countably infinite collections. To be able to deal with the collection when it is infinitely countable, we use measure-theoretic themes. Each member of a collection of motifs occurs a certain number of times on the fringe. We show that these numbers, under appropriate normalization, have a limiting joint multivariate normal distribution. We give a complete characterization of the asymptotic covariance matrix. The methods of proof include contraction in a metric space of distribution functions to a fixed-point solution (limit distribution). We discuss two examples: the finite collection of all possible motifs of size four, and the infinite collection of rooted stars. We conclude with remarks to compare fringe-analysis with matching motifs everywhere in the tree.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bergeron F, Flajolet P, Salvy B (1992) Varieties of increasing trees. In: Raoult JC (ed) Proceedings of the 17th colloquium on trees in algebra and programming (CAAP ’92). Lecture Notes in Computer Science, vol 581. Springer, Berlin/Heidelberg, pp 24–48
Billingsley P (1995) Probability and measure, 3rd edn. Wiley-Interscience
Chern HH, Hwang HK (2001) Phase changes in random m-ary search trees and generalized quicksort. Random Struct Algorithms 19:316–358
Dondajewski M, Szymański J (1982) On the distribution of vertex-degrees in a strata of a random recursive tree. Bulletin de l’Académie Polonaise des Sciences 30:205–209
Feng Q, Mahmoud HM (2010) On the variety of shapes on the fringe of a random recursive tree. J Appl Probab 47:191–200
Flajolet P, Gourdon X, Martínez C (1997) Patterns in random binary search trees. Random Struct Algorithms 11:223–244
van der Hofstad R, Hooghiemstra G, Van Mieghem P (2002) On the covariance of the level sizes in random recursive trees. Random Struct Algorithms 20:519–539
Maejima M, Rachev ST (1987) An ideal metric and the rate of convergence to a self-similar process. Ann Probab 15:708–727
McKenzie A, Steel M (2000) Distributions of cherries for two models of trees. Math Biosci 164:81–92
Na HS, Rapoport A (1970) Distribution of nodes of a tree by degree. Math Biosci 6:313–329
Najock D, Heyde CC (1982) On the number of terminal vertices in certain random trees with an application to stemma construction in philology. J Appl Probab 19:675–680
Neininger R (2001) On a multivariate contraction method for random recursive structures with applications to quicksort. Random Struct Algorithms 19:498–524
Neininger R, Rüschendorf L (2004) A general limit theorem for recursive algorithms and combinatorial structures. Ann Appl Probab 14:378–418
Panholzer A, Prodinger H (2004) Analysis of some statistics for increasing tree families. Discret Math Theor Comput Sci 6:437–460
Rachev ST, Rüschendorf L (1995) Probability metrics and recursive algorithms. Adv Appl Probab 27:770–799
Rösler U (1999) A limit theorem for “Quicksort”. Inform Théor Appl 25:85–100
Rösler U, Rüschendorf L (2001) The contraction method for recursive algorithms. Algorithmica 29:3–33
Smythe RT, Mahmoud H (1995) A survey of recursive trees. Theory Probab Math Stat 51:1–27
Szymański J (1987) On a nonuniform random recursive tree. In: Annals of discrete mathematics (33); proceedings of the international conference on finite geometries and combinatorial structures, vol 144. North-Holland, pp 297–306
Author information
Authors and Affiliations
Corresponding author
Additional information
Dedicated to the memory of Philippe Flajolet.
M. Gopaladesikan’s & M. D. Ward’s research is supported by NSF Science & Technology Center for Science of Information Grant CCF-0939370.
Rights and permissions
About this article
Cite this article
Gopaladesikan, M., Mahmoud, H. & Ward, M.D. Asymptotic Joint Normality of Counts of Uncorrelated Motifs in Recursive Trees. Methodol Comput Appl Probab 16, 863–884 (2014). https://doi.org/10.1007/s11009-013-9333-z
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11009-013-9333-z