A functional limit theorem for the profile of random recursive trees
Alexander Iksanov, Zakhar Kabluchko

TL;DR
This paper establishes a functional limit theorem showing that the scaled profile of a random recursive tree converges to a Gaussian process, specifically integrated Brownian motions, using branching process techniques.
Contribution
It introduces a new functional limit theorem for the profile of random recursive trees, linking it to Gaussian processes via branching process methods.
Findings
Convergence of the scaled profile to a Gaussian process.
Identification of the limit as integrated Brownian motions.
Application of branching process theory to tree profiles.
Abstract
Let be the number of vertices at level in a random recursive tree with vertices. We prove a functional limit theorem for the vector-valued process , for each . 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
