Asymptotic Analysis of Hoppe Trees

DOI10.1239/jap/1363784435zbMath1264.60021arXiv1202.2439MaRDI QIDQ4918574

Kevin Leckey, Ralph Neininger

Publication date: 25 April 2013

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1202.2439

zbMATH Keywords

weak convergence; martingale; random tree; combinatorial probability; Hoppe urn

Mathematics Subject Classification ID

60G42: Martingales with discrete parameter

60F05: Central limit and other weak theorems

05C05: Trees

68R05: Combinatorics in computer science

60C05: Combinatorial probability

Related Items

On densities for solutions to stochastic fixed point equations, Nonuniform recursive trees with vertex attraction depending on their labels, Correction terms for the height of weighted recursive trees, Asymptotic results on Hoppe trees and their variations

Cites Work

• A general limit theorem for recursive algorithms and combinatorial structures
• On the analysis of stochastic divide and conquer algorithms
• Poisson-Dirichlet branching random walks
• Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
• Limiting Distributions for Path Lengths in Recursive Trees
• The ages of alleles and a coalescent
• Total Path Length for Random Recursive Trees
• Size-biased filtering of Poisson–Dirichlet samples with an application to partition structures in genetics
• Poisson approximations for functionals of random trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item