Survival asymptotics for branching random walks in IID environments
Abstract
We first study a model, introduced recently in ES, of a critical branching random walk in an IID random environment on the d-dimensional integer lattice. The walker performs critical (0-2) branching at a lattice point if and only if there is no `obstacle' placed there. The obstacles appear at each site with probability p∈ [0,1) independently of each other. We also consider a similar model, where the offspring distribution is subcritical. Let Sn be the event of survival up to time n. We show that on a set of full Pp-measure, as n∞, (i) Critical case: Pω(Sn)2qn; (ii) Subcritical case: Pω(Sn)= [( -Cd,q· n( n)2/d )(1+o(1))], where Cd,q>0 does not depend on the branching law. Hence, the model exhibits `self-averaging' in the critical case but not in the subcritical one. I.e., in (i) the asymptotic tail behavior is the same as in a "toy model" where space is removed, while in (ii) the spatial survival probability is larger than in the corresponding toy model, suggesting spatial strategies. We utilize a spine decomposition of the branching process as well as some known results on random walks.
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.