Subgraph density and epidemics over networks

We model a SIS (susceptible-infected-susceptible) epidemics over a static, finite-sized network as a continuous-time Markov process using the scaled SIS epidemics model. In our previous work, we derived the closed form description of the equilibrium distribution that explicitly accounts for the network topology and showed that the most probable equilibrium state demonstrates threshold behavior. In this paper, we will show how subgraph structures in the network topology impact the most probable state of the long run behavior of a SIS epidemics (i.e., stochastic diffusion process) over any static, finite-sized, network.

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

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

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

[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]  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..

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

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

[8]  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).

[9]  Christos Faloutsos,et al.  Epidemic spreading in real networks: an eigenvalue viewpoint , 2003, 22nd International Symposium on Reliable Distributed Systems, 2003. Proceedings..