A functional limit theorem for the profile 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 prove a functional limit theorem for the vector-valued process (X[nt](1),…, X[nt](k))t≥ 0, for each k∈ N. We show that after proper centering and normalization, this process converges weakly to a vector-valued Gaussian process whose components are integrated Brownian motions. This result is deduced from a functional limit theorem for Crump-Mode-Jagers branching processes generated by increasing random walks with increments that have finite second moment.

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…