Weak convergence of the number of vertices at intermediate levels of random recursive trees

Abstract

Let Xn(k) be the number of vertices at level k in a random recursive tree with n+1 vertices. We are interested in the asymptotic behavior of Xn(k) for intermediate levels k=kn satisfying kn∞ and kn=o( n) as n∞. In particular, we prove weak convergence of finite-dimensional distributions for the process (Xn ([kn u]))u>0, properly normalized and centered, as n∞. The limit is a centered Gaussian process with covariance (u,v) (u+v)-1. One-dimensional distributional convergence of Xn(kn), properly normalized and centered, was obtained with the help of analytic tools by Fuchs, Hwang and Neininger in 2006. In contrast, our proofs which are probabilistic in nature exploit a connection of our model with certain Crump-Mode-Jagers branching processes.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…