The SIR Model and Identification of Spreaders

In this chapter, we review the classic susceptible-infected-recovered (SIR) model for disease spread as applied to a social network. In particular, we look at the problem of identifying nodes that are “spreaders” which cause a large part of the population to become infected under this model. To do so, we survey a variety of nodal measures based on centrality (degree, betweenness, etc.) and other methods (shell decomposition, nearest neighbor analysis, etc.). We then present a set of experiments that illustrate the relation of these nodal measures to spreading under the SIR model.

[1]  Cohen,et al.  Resilience of the internet to random breakdowns , 2000, Physical review letters.

[2]  Romualdo Pastor-Satorras,et al.  Competing activation mechanisms in epidemics on networks , 2011, Scientific Reports.

[3]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[4]  Stephen B. Seidman,et al.  Network structure and minimum degree , 1983 .

[5]  Lev Muchnik,et al.  Identifying influential spreaders in complex networks , 2010, 1001.5285.

[6]  S Redner,et al.  Evolutionary dynamics on degree-heterogeneous graphs. , 2006, Physical review letters.

[7]  Yuval Shavitt,et al.  A model of Internet topology using k-shell decomposition , 2007, Proceedings of the National Academy of Sciences.

[8]  R. May,et al.  Population biology of infectious diseases: Part II , 1979, Nature.

[9]  N. Madar,et al.  Immunization and epidemic dynamics in complex networks , 2004 .

[10]  D S Callaway,et al.  Network robustness and fragility: percolation on random graphs. , 2000, Physical review letters.

[11]  Yicheng Zhang,et al.  Identifying influential nodes in complex networks , 2012 .

[12]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[13]  Vladimir Batagelj,et al.  Network Data Sets , 2004 .

[14]  Paulo Shakarian,et al.  Spreaders in the Network SIR Model: An Empirical Study , 2012, ArXiv.

[15]  Martin G. Everett,et al.  A Graph-theoretic perspective on centrality , 2006, Soc. Networks.

[16]  P. Bonacich.  Factoring and weighting approaches to status scores and clique identification , 1972 .

[17]  Yamir Moreno,et al.  Locating privileged spreaders on an online social network. , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

[19]  Yamir Moreno,et al.  Absence of influential spreaders in rumor dynamics , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  U. Brandes.  A faster algorithm for betweenness centrality , 2001 .