Recognition: unknown
Branching random walks and contact processes on Galton-Watson trees
classification
🧮 math.PR
keywords
branchingcontactprocessesrandomwalksgalton-watsonacrossambient
read the original abstract
We consider branching random walks and contact processes on infinite, connected, locally finite graphs whose reproduction and infectivity rates across edges are inversely proportional to vertex degree. We show that when the ambient graph is a Galton-Watson tree then, in certain circumstances, the branching random walks and contact processes will have weak survival phases. We also provide bounds on critical values.
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.