The SIR model and identification of spreaders

Paulo Shakarian, Abhinav Bhatnagar, Ashkan Aleali, Elham Shaabani, Ruocheng Guo

Research output: Chapter in Book/Report/Conference proceedingChapter

3 Scopus citations

Abstract

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.

Original languageEnglish (US)
Title of host publicationSpringerBriefs in Computer Science
PublisherSpringer
Pages3-18
Number of pages16
Edition9783319231044
DOIs
StatePublished - 2015

Publication series

NameSpringerBriefs in Computer Science
Number9783319231044
Volume0
ISSN (Print)2191-5768
ISSN (Electronic)2191-5776

Keywords

  • Betweenness centrality
  • Border gateway protocol
  • Centrality measure
  • Closeness centrality
  • Eigenvector centrality

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'The SIR model and identification of spreaders'. Together they form a unique fingerprint.

Cite this