Laws of the iterated logarithm for iterated perturbed random walks
Abstract
Let (k, ηk)k≥ 1be independent identically distributed random vectors with arbitrarily dependent positive components and Tk:=1+…+k-1+ηkfor k∈N. We call the random sequence Tk, k=1,2... a (globally) perturbed random walk. Consider a general branching process generated by Tk, k=1,2... and let Yj(t) denote the number of the jth generation individuals with birth times less or equal t. Assuming that Var 1 is finite and allowing the distribution of η1 to be arbitrary, we prove a law of the iterated logarithm (LIL) for Yj(t). In particular, a LIL for the counting process of Tk, k=1,2... is obtained. The latter result was previously established in the article Iksanov, Jedidi and Bouzeffour (2017) under the additional assumption that Eηa is finite for some positive a. In this paper, we show that the aforementioned additional assumption is not needed.
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.