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

Abstract

Consider a Crump-Mode-Jagers process generated by an increasing random walk whose increments have finite second moment. Let Yk(t) be the number of individuals in generation k∈ N born in the time interval [0,t]. We prove a law of the iterated logarithm for Yk(t) with fixed k, as t +∞. 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 ∞.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…