Hostname: page-component-cd9895bd7-gxg78 Total loading time: 0 Render date: 2024-12-23T18:34:54.061Z Has data issue: false hasContentIssue false
  • English
  • Français

Limit Theorems for Depths and Distances in Weighted Random B-Ary Recursive Trees

Part of: Combinatorial probability Graph theory Limit theorems

Published online by Cambridge University Press:  14 July 2016

Götz Olaf Munsonius  and
Ludger Rüschendorf
Götz Olaf Munsonius*
Affiliation:
University of Freiburg
Ludger Rüschendorf*
Affiliation:
University of Freiburg
*
∗ Current address: Institute of Mathematics, University of Frankfurt, 60054 Frankfurt am Main, Germany. Email address: [email protected]
∗∗ Postal address: Department of Mathematical Stochastics, University of Freiburg, Eckerstraße 1, 79104 Freiburg, Germany. Email address: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Limit theorems are established for some functionals of the distances between two nodes in weighted random b-ary recursive trees. We consider the depth of the nth node and of a random node, the distance between two random nodes, the internal path length, and the Wiener index. As an application, these limit results imply, by an imbedding argument, corresponding limit theorems for further classes of random trees: plane-oriented recursive trees and random linear recursive trees.

Keywords

Random treeWiener indexpath lengthcontraction methodplane-oriented recursive tree

MSC classification

Secondary: 05C05: Trees 60C05: Combinatorial probability 60F05: Central limit and other weak theorems
Type
Research Papers
Information
Journal of Applied Probability , Volume 48 , Issue 4 , December 2011 , pp. 1060 - 1080
Copyright
Copyright © Applied Probability Trust 2011 

References

Athreya, K. B. (1969). On a characteristic property of Polya's urn. Studia Sci. Math. Hung. 4, 31–35.Google Scholar
Bergeron, F., Flajolet, P. and Salvy, B. (1992). Varieties of increasing trees. In CAAP '92 (Rennes, 1992; Lecture Notes Comput. Sci. 581), Springer, Berlin, pp. 24–48.Google Scholar
Broutin, N. and Devroye, L. (2006). Large deviations for the weighted height of an extended class of trees. Algorithmica 46, 271–297.Google Scholar
Chow, Y. S. and Teicher, H. (1997). Probability Theory, 3rd edn. Springer, New York.Google Scholar
Devroye, L. (1999). Universal limit laws for depths in random trees. SIAM J. Comput. 28, 409–432.Google Scholar
Devroye, L. and Neininger, R. (2004). Distances and finger search in random binary search trees. SIAM J. Comput. 33, 647–658.Google Scholar
Dobrow, R. P. and Fill, J. A. (1999). Total path length for random recursive trees. Combinatorics Prob. Comput. 8, 317–333.Google Scholar
Drmota, M. (2009). Random Trees. SpringerWienNewYork, Vienna.Google Scholar
Janson, S. (2003). The Wiener index of simply generated random trees. Random Structures Algorithms 22, 337–358.Google Scholar
Javanian, M. and Vahidi-Asl, M. Q. (2006). Depth of nodes in random recursive k-ary trees. Inform. Process. Lett. 98, 115–118.Google Scholar
Johnson, N. L. and Kotz, S. (1977). Urn Models and Their Application. John Wiley, New York.Google Scholar
Kuba, M. and Panholzer, A. (2010). On the distribution of distances between specified nodes in increasing trees. Discrete Appl. Math. 158, 489–506.Google Scholar
Mahmoud, H. M. (1992). Distances in random plane-oriented recursive trees. J. Comput. Appl. Math. 41, 237–245.Google Scholar
Mahmoud, H. M. and Neininger, R. (2003). Distribution of distances in random binary search trees. Ann. Appl. Prob. 13, 253–276.Google Scholar
Morris, K., Panholzer, A. and Prodinger, H. (2004). On some parameters in heap ordered trees. Combinatorics Prob. Comput. 13, 677–696.Google Scholar
Munsonius, G. O. (2010). Limit theorems for functionals of recursive trees. , University of Freiburg. Available at http://www.freidok.uni-freiburg.de/volltexte/7472.Google Scholar
Neininger, R. (2001). On a multivariate contraction method for random recursive structures with applications to Quicksort. Random Structures Algorithms 19, 498–524.Google Scholar
Neininger, R. (2002). The Wiener index of random trees. Combinatorics Prob. Comput. 11, 587–597.Google Scholar
Neininger, R. and Rüschendorf, L. (1999). On the internal path length of d-dimensional quad trees. Random Structures Algorithms 15, 25–41.Google Scholar
Neininger, R. and Rüschendorf, L. (2004). A general limit theorem for recursive algorithms and combinatorial structures. Ann. Appl. Prob. 14, 378–418.Google Scholar
Panholzer, A. (2004a). The distribution of the size of the ancestor-tree and of the induced spanning subtree for random trees. Random Structures Algorithms 25, 179–207.Google Scholar
Panholzer, A. (2004b). Distribution of the Steiner distance in generalized M-ary search trees. Combinatorics Prob. Comput. 13, 717–733.Google Scholar
Panholzer, A. and Prodinger, H. (2004a). Analysis of some statistics for increasing tree families. Discrete Math. Theoret. Comput. Sci. 6, 437–460.Google Scholar
Panholzer, A. and Prodinger, H. (2004b). Spanning tree size in random binary search trees. Ann. Appl. Prob. 14, 718–733.Google Scholar
Panholzer, A. and Prodinger, H. (2007). Level of nodes in increasing trees revisited. Random Structures Algorithms 31, 203–226.Google Scholar
Pittel, B. (1994). Note on the heights of random recursive trees and random m-ary search trees. Random Structures Algorithms 5, 337–347.Google Scholar
Quintas, L. V. and Szymański, J. (1992). Nonuniform random recursive trees with bounded degree. In Sets, Graphs and Numbers (Budapest, 1991; Colloq. Math. Soc. János Bolyai 60), North-Holland, Amsterdam, pp. 611–620.Google Scholar
Rösler, U. (1991). A limit theorem for “Quicksort”. RAIRO Inf. Théor. Appl. 25, 85–100.Google Scholar
Roura, S. (2001). Improved master theorems for divide-and-conquer recurrences. J. Assoc. Comput. Mach. 48, 170–205.Google Scholar
Ryvkina, J. (2008). Ein universeller zentraler Grenzwertsatz für den Abstand zweier Kugeln in zufälligen Splitbäumen. , University of Frankfurt.Google Scholar
Smythe, R. T. and Mahmoud, H. M. (1995). A survey of recursive trees. Theory Prob. Math. Statist. 51, 1–27.Google Scholar
Stanley, R. P. (1997). Enumerative Combinatorics (Camb. Stud. Adv. Math. 49), Vol. 1. Cambridge University Press.Google Scholar
Su, C., Liu, J. and Feng, Q. (2006). A note on the distance in random recursive trees. Statist. Prob. Lett. 76, 1748–1755.Google Scholar
Szymański, J. (1987). On a nonuniform random recursive tree. In Random Graphs '85 (Poznań, 1985; North-Holland Math. Stud. 144), North-Holland, Amsterdam, pp. 297–306.Google Scholar