Contact process on a graph with communities

MaRDI QIDQ2954467zbMATH OpenFDO

Authors David Sivakoff

Publication date 13 January 2017

Full work available at URL https://arxiv.org/abs/1210.3434, http://alea.impa.br/articles/v14/14-02.pdf

zbMATH Keywords

contact processepidemicrandom graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Central limit and other weak theorems (60F05) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Epidemiology (92D30)

Abstract: 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<a<1), then add a small set of bridge edges, B, between the communities. We model the epidemic on this network as a contact process (Susceptible-Infected-Susceptible infection) with infection rate lambda and recovery rate 1. If nplambda = b > 1 then the contact process on the Erdos-Renyi random graph is supercritical, and we show that it survives for exponentially long. Further, let au be the time to infect a positive fraction of vertices in the second community when the infection starts from a single vertex in the first community. We show that on the event that the contact process survives exponentially long, au |B|/(np) converges in distribution to an exponential random variable with a specified rate. These results generalize to a graph with N communities.

Recommendations

• A two-stage contact process on scale-free networks
• Contagions in random networks with overlapping communities
• Contact processes on scale-free networks
• Contact processes on random regular graphs
• Infection spread in random geometric graphs

Cites work

• Contact processes on random graphs with power law degree distributions have critical value 0
• Cutoff phenomena for random walks on random regular graphs
• Exponential extinction time of the contact process on finite graphs
• scientific article; zbMATH DE number 1350307 (Why is no real title available?)
• scientific article; zbMATH DE number 3190745 (Why is no real title available?)
• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• Metastability for the contact process on the configuration model with infinite mean degree
• Metastable densities for the contact process on power law random graphs
• On the spread of viruses on the Internet
• The contact process on the complete graph with random vertex-dependent infection rates
• The isoperimetric number of random regular graphs

Cited in

(7)

• The effect of avoiding known infected neighbors on the persistence of a recurring infection process
• Bootstrap percolation on the product of the two-dimensional lattice with a Hamming square
• Contagions in random networks with overlapping communities
• The front of the epidemic spread and first passage percolation
• Infection spread in random geometric graphs
• Subcritical epidemics on random graphs
• A re-entrant phase transition in the survival of secondary infections on networks

This page was built for publication: Contact process on a graph with communities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2954467)