Large deviations for the branching random walk with heavy-tailed associated random walk - a principle of one big jump

Abstract

We prove a version of Nagaev's theorem for the branching random walk with heavy-tailed associated random walk. For a branching random walk on R we consider the random measure Zn = Σ|u|=n e-Vu δVu where Vu, |u| = n denote the positions of the particles in the n-th generation. Under the assumption that E[Z1(·)] is a probability distribution with regularly varying tail, we prove that Zn((nE[X] + tn , ∞)) = W nP(X > tn )(1 + o(1)) in L1 as n ∞ where W is a non-zero random variable, tn ∞ grows suitably fast, and X has law E[Z1(·)]. The result is explained probabilistically by a principle of one big jump for the branching random walk.

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…