On the maximal displacement of subcritical branching random walks with or without killing

Abstract

Consider a subcritical branching random walk \Zk\k≥ 0 with offspring distribution \pk\k≥ 0 and step size X. Let Mn denote the rightmost position reached by \Zk\k≥ 0 up to generation n, and define M := n≥ 0 Mn. In this paper we give asymptotics of tail probability of M under optimal assumptions Σ∞k=1(k k) pk<∞ and E[Xeγ X]<∞, where γ >0 is a constant such that E[eγ X]=1m and m=Σk=0∞ kpk∈ (0,1). Moreover, we confirm the conjecture of Neuman and Zheng [Probab. Theory Related Fields. 167 (2017) 1137--1164] by establishing the existence of a critical value mE[X eγ X] such that align* n∞eγ cnP(Mn≥ cn)= \ aligned & ∈(0,1], &c∈(0,mE[Xeγ X]); &0, &c∈(mE[Xeγ X],∞), aligned . align* where represents the non-zero limit. Finally, we extend these results to the maximal displacement of branching random walks with killing. Interestingly, this limit can be characterized through both the global minimum of a random walk with positive drift and the maximal displacement of the branching random walk without killing.

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…