Contact process on a graph with communities

  title={Contact process on a graph with communities},
  author={David Sivakoff},
  journal={arXiv: Probability},
We are interested in the spread of an epidemic between two communities that have higher connectivity within than between them. We model the two communities as independent Erdos-Renyi random graphs, each with n vertices and edge probability p = n^{a-1} (0 1 then the contact process on the Erdos-Renyi random graph is supercritical, and we show that it survives for exponentially long. Further, let \tau be the time to infect a positive fraction of vertices in the second community when the infection… Expand
3 Citations

Figures from this paper


The contact process on the complete graph with random vertex-dependent infection rates
Contact processes on random graphs with power law degree distributions have critical value 0
Metastable densities for the contact process on power law random graphs
On the spread of viruses on the internet
Epidemic spreading in scale-free networks.
Epidemic dynamics and endemic states in complex networks.
Cutoff phenomena for random walks on random regular graphs
The Isoperimetric Number of Random Regular Graphs