Weak survival for branching random walks on graphs

preprint2007arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.