Asymptotic analysis of hoppe trees

9Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

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 wellstudied 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. © Applied Probability Trust 2013.

Cite

CITATION STYLE

APA

Leckey, K., & Neininger, R. (2013). Asymptotic analysis of hoppe trees. Journal of Applied Probability, 50(1), 228–238. https://doi.org/10.1239/jap/1363784435

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free