Boundedness of discounted branching random walks via generic chaining

Abstract

Consider a discrete-time supercritical discounted branching random walk, in which increments at depth k are independent and identically distributed with the same law as m-kHY, where Y has a fixed law, H>0, and m>1 is the expected number of offspring at depth one. We provide a clean characterization of the boundedness of the discounted branching random walk: under mild conditions on the offspring distribution, the process is almost surely bounded if and only if E[|Y|1/H]<∞. This extends results of Athreya (1985) and A\"id\'ekon--Hu--Shi (2024), and provides a partial answer to Open Problem 31 of Aldous--Bandyopadhyay (2005).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…