Survival, extinction and approximation of discrete-time branching random walks

Abstract

We consider a general discrete-time branching random walk on a countable set X. We relate local, strong local and global survival with suitable inequalities involving the first-moment matrix M of the process. In particular we prove that, while the local behavior is characterized by M, the global behavior cannot be completely described in terms of properties involving M alone. Moreover we show that locally surviving branching random walks can be approximated by sequences of spatially confined and stochastically dominated branching random walks which eventually survive locally if the (possibly finite) state space is large enough. An analogous result can be achieved by approximating a branching random walk by a sequence of multitype contact processes and allowing a sufficiently large number of particles per site. We compare these results with the ones obtained in the continuous-time case and we give some examples and counterexamples.

32 pages, a few misprints have been corrected

References in corpus (1)

• Characterization of the critical values of branching random walks on weighted graphs through infinite-type branching processes

Cited by in corpus (9)

• Extinction in lower Hessenberg branching processes with countably many types
• Rumor processes in random environment on N and on Galton-Watson trees
• Recent results on branching random walks
• Branching random walks and multi-type contact-processes on the percolation cluster of ${\mathbb{Z}}^d$
• Interacting growth processes and invariant percolation
• The probabilities of extinction in a branching random walk on a strip
• Global survival of branching random walks and tree-like branching random walks
• The timing of life history events in presence of soft disturbances
• Persistent and susceptible bacteria with individual deaths