Contact process with exogenous infection and the scaled SIS process

Propagation of contagion in networks depends on the graph topology. This paper is concerned with studying the time-asymptotic behavior of the extended contact processes on static, undirected, finite-size networks. This is a contact process with nonzero exogenous infection rate (also known as the {\epsilon}-SIS, {\epsilon} susceptible-infected-susceptible, model [1]). The only known analytical characterization of the equilibrium distribution of this process is for complete networks. For large networks with arbitrary topology, it is infeasible to numerically solve for the equilibrium distribution since it requires solving the eigenvalue-eigenvector problem of a matrix that is exponential in N , the size of the network. We show that, for a certain range of the network process parameters, the equilibrium distribution of the extended contact process on arbitrary, finite-size networks is well approximated by the equilibrium distribution of the scaled SIS process, which we derived in closed-form in prior work. We confirm this result with numerical simulations comparing the equilibrium distribution of the extended contact process with that of a scaled SIS process. We use this approximation to decide, in polynomial-time, which agents and network substructures are more susceptible to infection by the extended contact process.

[1]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[2]  D. Vere-Jones Markov Chains , 1972, Nature.

[3]  José M. F. Moura,et al.  Accounting for topology in spreading contagion in non-complete networks , 2012, 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[4]  José M. F. Moura,et al.  Diffusion in Social Networks as SIS Epidemics: Beyond Full Mixing and Complete Graphs , 2014, IEEE Journal of Selected Topics in Signal Processing.

[5]  P. Van Mieghem,et al.  Epidemics in networks with nodal self-infection and the epidemic threshold. , 2012, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  Mason A. Porter,et al.  Dynamical Systems on Networks: A Tutorial , 2014, ArXiv.

[7]  Shweta Bansal,et al.  Eight challenges for network epidemic models. , 2015, Epidemics.

[8]  Kathryn Fraughnaugh,et al.  Introduction to graph theory , 1973, Mathematical Gazette.

[9]  M. Keeling,et al.  Networks and epidemic models , 2005, Journal of The Royal Society Interface.

[10]  Samir Khuller,et al.  On Finding Dense Subgraphs , 2009, ICALP.

[11]  V. Climenhaga Markov chains and mixing times , 2013 .

[12]  Jure Leskovec,et al.  {SNAP Datasets}: {Stanford} Large Network Dataset Collection , 2014 .

[13]  Odo Diekmann,et al.  Mathematical Tools for Understanding Infectious Disease Dynamics , 2012 .

[14]  Donald F. Towsley,et al.  The effect of network topology on the spread of epidemics , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[15]  T. Liggett,et al.  Stochastic Interacting Systems: Contact, Voter and Exclusion Processes , 1999 .

[16]  José M. F. Moura,et al.  Threshold behavior of epidemics in regular networks , 2013, 2013 IEEE International Conference on Acoustics, Speech and Signal Processing.

[17]  José M. F. Moura,et al.  Emergent behavior in large scale networks , 2011, IEEE Conference on Decision and Control and European Control Conference.

[18]  John G. Proakis,et al.  Probability, random variables and stochastic processes , 1985, IEEE Trans. Acoust. Speech Signal Process..

[19]  Anthony Unwin,et al.  Reversibility and Stochastic Networks , 1980 .

[20]  Alessandro Vespignani,et al.  Dynamical Processes on Complex Networks , 2008 .

[21]  José M. F. Moura,et al.  Role of subgraphs in epidemics over finite-size networks under the scaled SIS process , 2014, J. Complex Networks.

[22]  Laurent Massoulié,et al.  Thresholds for virus spread on networks , 2006, valuetools '06.