Low-dimensional lonely branching random walks die out
classification
🧮 math.PR
keywords
branchingrandomlonelywalkwalksaloneparticlewhen
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.