Journal of Applied Probability

Asymptotic analysis of Hoppe trees

Kevin Leckey and Ralph Neininger

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

We introduce and analyze a random tree model associated to Hoppe's urn. The tree is built successively by adding nodes to the existing tree when starting with the single root node. In each step a node is added to the tree as a child of an existing node, where these parent nodes are chosen randomly with probabilities proportional to their weights. The root node has weight ϑ>0, a given fixed parameter, all other nodes have weight 1. This resembles the stochastic dynamic of Hoppe's urn. For ϑ=1, the resulting tree is the well-studied random recursive tree. We analyze the height, internal path length, and number of leaves of the Hoppe tree with n nodes as well as the depth of the last inserted node asymptotically as n→∞. Mainly expectations, variances, and asymptotic distributions of these parameters are derived.

Article information

Source
J. Appl. Probab., Volume 50, Number 1 (2013), 228-238.

Dates
First available in Project Euclid: 20 March 2013

Permanent link to this document
https://projecteuclid.org/euclid.jap/1363784435

Digital Object Identifier
doi:10.1239/jap/1363784435

Mathematical Reviews number (MathSciNet)
MR3076783

Zentralblatt MATH identifier
1264.60021

Subjects
Primary: 60F05: Central limit and other weak theorems 60C05: Combinatorial probability
Secondary: 60G42: Martingales with discrete parameter 68R05: Combinatorics

Keywords
Hoppe urn random tree weak convergence martingale combinatorial probability

Citation

Leckey, Kevin; Neininger, Ralph. Asymptotic analysis of Hoppe trees. J. Appl. Probab. 50 (2013), no. 1, 228--238. doi:10.1239/jap/1363784435. https://projecteuclid.org/euclid.jap/1363784435


Export citation

References

  • Abramowitz, M. and Stegun, I. A. (1964). Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables (Natl. Bureau Standards Appl. Math. Ser. 55). Government Printing Office, Washington, DC.
  • Addario-Berry, L. and Ford, K. (2013). Poisson–Dirichlet branching random walks. Ann. Appl. Prob. 23, 283–307.
  • Barbour, A. D., Holst, L. and Janson, S. (1992). Poisson Approximation (Oxford Stud. Prob. 2). The Clarendon Press, Oxford University Press, New York.
  • Dobrow, R. P. and Fill, J. A. (1999). Total path length for random recursive trees. Combin. Prob. Comput. 8, 317–333.
  • Dobrow, R. P. and Smythe, R. T. (1996). Poisson approximations for functionals of random trees. Random Structures Algorithms 9, 79–92.
  • Donnelly, P. and Tavaré, S. (1986). The ages of alleles and a coalescent. Adv. Appl. Prob. 18, 1–19. (Correction: 18 (1986), 1023.)
  • Fill, J. A. and Janson, S. (2000). Smoothness and decay properties of the limiting Quicksort density function. In Mathematics and Computer Science (Versailles, 2000), Birkhäuser, Basel, pp. 53–64.
  • Hall, P. and Heyde, C. C. (1980). Martingale Limit Theory and Its Application. Academic Press, New York.
  • Hoppe, F. M. (1986). Size-biased filtering of Poisson–Dirichlet samples with an application to partition structures in genetics. J. Appl. Prob. 23, 1008–1012.
  • Leckey, K. (2011). Asymptotische Eigenschaften von Hoppe–Bäumen. Masters Thesis, Goethe Universität Frankfurt a.M. Available at http://publikationen.ub.uni-frankfurt.de/frontdoor/index/index/docId/24214.
  • Mahmoud, H. M. (1991). Limiting distributions for path lengths in recursive trees. Prob. Eng. Inf. Sci. 5, 53–59.
  • Neininger, R. and Rüschendorf, L. (2004). A general limit theorem for recursive algorithms and combinatorial structures. Ann. Appl. Prob. 14, 378–418.
  • Pitman, J. (2006). Combinatorial Stochastic Processes (Lecture Notes Math. 1875). Springer, Berlin.
  • Rösler, U. (2001). On the analysis of stochastic divide and conquer algorithms. Algorithmica 29, 238–261.
  • Smythe, R. T. and Mahmoud, H. M. (1994). A survey of recursive trees. Teor. Ĭmov\=\i r. Mat. Statist. 51, 1–29. English translation: Theory Prob. Math. Statist. 51 (1995), 1–27.