arXiv Analytics

Sign in

arXiv:1801.04606 [math.PR]AbstractReferencesReviewsResources

A functional limit theorem for the profile of random recursive trees

Alexander Iksanov, Zakhar Kabluchko

Published 2018-01-14Version 1

Let $X_n(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_{[n^t]}(1),\ldots, X_{[n^t]}(k))_{t\geq 0}$, for each $k\in\mathbb 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.

Related articles: Most relevant | Search more
arXiv:2212.13441 [math.PR] (Published 2022-12-27)
A law of the iterated logarithm for iterated random walks, with application to random recursive trees
arXiv:math/0609385 [math.PR] (Published 2006-09-14, updated 2008-01-22)
A functional limit theorem for the profile of search trees
arXiv:1902.06249 [math.PR] (Published 2019-02-17)
A functional limit theorem for coin tossing Markov chains