Critical value asymptotics for the contact process on random graphs
From MaRDI portal
Abstract: Recent progress in the study of the contact process [2] has verified that the extinction-survival threshold on a Galton-Watson tree is strictly positive if and only if the offspring distribution has an exponential tail. In this paper, we derive the first-order asymptotics of for the contact process on Galton-Watson trees and its corresponding analog for random graphs. In particular, if is appropriately concentrated around its mean, we demonstrate that as , which matches with the known asymptotics on the -regular trees. The same result for the short-long survival threshold on the ErdH{o}s-R'enyi and other random graphs are shown as well.
Recommendations
- The contact process on random graphs and Galton Watson trees
- Survival and extinction of epidemics on random graphs with general degree
- Phase transition of the contact process on random regular graphs
- The contact process on a tree: Behavior near the first phase transition
- Extinction time for the contact process on general graphs
Cites work
- A critical point for random graphs with a given degree sequence
- Contact interactions on a lattice
- Contact processes on random regular graphs
- Contact processes with random recovery rates and edge weights on complete graphs
- Contact processes with random vertex weights on oriented lattices
- Critical value for the contact process with random recovery rates and edge weights on regular tree
- Cutoff phenomena for random walks on random regular graphs
- Gibbs measures and phase transitions on sparse random graphs
- scientific article; zbMATH DE number 1350307 (Why is no real title available?)
- Interacting particle systems. With a new postface.
- Multiple transition points for the contact process on the binary tree
- Phase transition of the contact process on random regular graphs
- Poisson Cloning Model for Random Graphs
- Probability. Theory and examples.
- Random graph dynamics
- Random graphs and complex networks. Volume 1
- Survival and extinction of epidemics on random graphs with general degree
- The contact process on random graphs and Galton Watson trees
- The contact process on the complete graph with random vertex-dependent infection rates
- The contact process on trees
- The critical contact process dies out
- The existence of an intermediate phase for the contact process on trees
- The probability that a random multigraph is simple
Cited in
(13)- The asymmetric contact process on a finite set
- A first order phase transition in the threshold \(\theta \geq 2\) contact process on random \(r\)-regular graphs and \(r\)-trees
- Survival and extinction of epidemics on random graphs with general degree
- Branching random walks and contact processes on Galton-Watson trees
- scientific article; zbMATH DE number 5733441 (Why is no real title available?)
- The contact process on random graphs and Galton Watson trees
- Analysis of the survival time of the SIRS process via expansion
- Understanding the impact of non-linearity in the SIS model
- Subcritical epidemics on random graphs
- The contact process on a graph adapting to the infection
- Hydrodynamic limits of non-Markovian interacting particle systems on sparse graphs
- Asymptotic behavior of critical infection rates for threshold-one contact processes on lattices and regular trees
- Contact processes on random graphs with power law degree distributions have critical value 0
This page was built for publication: Critical value asymptotics for the contact process on random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5082394)