arXiv Analytics

Sign in

arXiv:2212.13441 [math.PR]AbstractReferencesReviewsResources

A law of the iterated logarithm for iterated random walks, with application to random recursive trees

Alexander Iksanov, Zakhar Kabluchko, Valeriya Kotelnikova

Published 2022-12-27Version 1

Consider a Crump-Mode-Jagers process generated by an increasing random walk whose increments have finite second moment. Let $Y_k(t)$ be the number of individuals in generation $k\in \mathbb N$ born in the time interval $[0,t]$. We prove a law of the iterated logarithm for $Y_k(t)$ with fixed $k$, as $t\to +\infty$. As a consequence, we derive a law of the iterated logarithm for the number of vertices at a fixed level $k$ in a random recursive tree, as the number of vertices goes to $\infty$.

Related articles: Most relevant | Search more
arXiv:math/0604350 [math.PR] (Published 2006-04-15, updated 2008-09-25)
Continuum tree asymptotics of discrete fragmentations and applications to phylogenetic models
arXiv:0904.0185 [math.PR] (Published 2009-04-01)
Pointwise ergodic theorems with rate and application to limit theorems for stationary processes
arXiv:math/0408128 [math.PR] (Published 2004-08-10)
Dual random fragmentation and coagulation and an application to the genealogy of Yule processes