Weak survival for branching random walks on graphs
Probability
2011-01-25 v2
Abstract
We study weak and strong survival for branching random walks on multigraphs. We prove that, for a large class of multigraphs, weak survival is related to a geometrical parameter of the multigraph and that the existence of a pure weak phase is equivalent to nonamenability. Finally we study weak and strong critical behaviors of the branching random walk.
Keywords
Cite
@article{arxiv.math/0603412,
title = {Weak survival for branching random walks on graphs},
author = {Daniela Bertacchi and Fabio Zucca},
journal= {arXiv preprint arXiv:math/0603412},
year = {2011}
}
Comments
20 pages; corrected typos and weakened Definition 3.6