Low-dimensional lonely branching random walks die out

2017/08/21 by Matthias Birkner, Birkner, Matthias, Rongfeng Sun +1
Mathematics · #FOS: Mathematics #Probability (math.PR) #math.PR

paper · pdf · doi:10.48550/arxiv.1708.06377

22 pages, 1 figure

arxiv created 2017/08/21 · arxiv updated 2017/08/23

Abstract

The lonely branching random walks on \mathbb Z^d is an interacting particle system where each particle moves as an independent random walk and undergoes critical binary branching when it is alone. We show that if the symmetrized walk is recurrent, lonely branching random walks die out locally. Furthermore, the same result holds if additional branching is allowed when the walk is not alone.

Related

• The critical branching random walk in a random environment dies out
• Time spent in a ball by a critical branching random walk
• Branching Particle Systems with Mutually Catalytic Interactions
• Survival Analysis of Particle Populations in Branching Random Walks
• Recent results on branching random walks