Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-18T07:45:21.764Z Has data issue: false hasContentIssue false

Critical Behaviors and Critical Values of Branching Random Walks on Multigraphs

Published online by Cambridge University Press:  14 July 2016

Daniela Bertacchi*
Affiliation:
Università di Milano - Bicocca
Fabio Zucca*
Affiliation:
Politecnico di Milano
*
∗ Postal address: Dipartimento di Matematica e Applicazioni, Università di Milano - Bicocca, via Cozzi 53, 20125 Milano, Italy. Email address: daniela.bertacchi@unimib.it
∗∗ Postal address: Dipartimento di Matematica, Politecnico di Milano, piazza Leonardo da Vinci 32, 20133 Milano, Italy. Email address: fabio.zucca@polimi.it
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We consider weak and strong survival for branching random walks on multigraphs with bounded degree. We prove that, at the strong critical value, the process dies out locally almost surely. We relate the weak critical value to a geometric parameter of the multigraph. For a large class of multigraphs (which enlarges the class of quasi-transitive or regular graphs), we prove that, at the weak critical value, the process dies out globally almost surely. Moreover, for the same class, we prove that the existence of a pure weak phase is equivalent to nonamenability. The results are extended to branching random walks on weighted graphs.

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 2008