The SIR model and identification of spreaders

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

doi:10.1007/978-3-319-23105-1_2

The SIR model and identification of spreaders

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

Research output: Chapter in Book/Report/Conference proceeding › Chapter

5 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 language	English (US)
Title of host publication	SpringerBriefs in Computer Science
Publisher	Springer
Pages	3-18
Number of pages	16
Edition	9783319231044
DOIs	https://doi.org/10.1007/978-3-319-23105-1_2
State	Published - 2015

Publication series

Name	SpringerBriefs in Computer Science
Number	9783319231044
Volume	0
ISSN (Print)	2191-5768
ISSN (Electronic)	2191-5776

Keywords

Betweenness centrality
Border gateway protocol
Centrality measure
Closeness centrality
Eigenvector centrality

ASJC Scopus subject areas

General Computer Science

Access to Document

10.1007/978-3-319-23105-1_2

Cite this

@inbook{1d77369ca138487e9ef0439a8e7d2dc8,

title = "The SIR model and identification of spreaders",

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.",

keywords = "Betweenness centrality, Border gateway protocol, Centrality measure, Closeness centrality, Eigenvector centrality",

author = "Paulo Shakarian and Abhinav Bhatnagar and Ashkan Aleali and Elham Shaabani and Ruocheng Guo",

note = "Publisher Copyright: {\textcopyright} 2015, The Author(s).",

year = "2015",

doi = "10.1007/978-3-319-23105-1_2",

language = "English (US)",

series = "SpringerBriefs in Computer Science",

publisher = "Springer",

number = "9783319231044",

pages = "3--18",

booktitle = "SpringerBriefs in Computer Science",

edition = "9783319231044",

}

TY - CHAP

T1 - The SIR model and identification of spreaders

AU - Shakarian, Paulo

AU - Bhatnagar, Abhinav

AU - Aleali, Ashkan

AU - Shaabani, Elham

AU - Guo, Ruocheng

PY - 2015

Y1 - 2015

N2 - 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.

AB - 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.

KW - Betweenness centrality

KW - Border gateway protocol

KW - Centrality measure

KW - Closeness centrality

KW - Eigenvector centrality

UR - http://www.scopus.com/inward/record.url?scp=85044956999&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85044956999&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-23105-1_2

DO - 10.1007/978-3-319-23105-1_2

M3 - Chapter

AN - SCOPUS:85044956999

T3 - SpringerBriefs in Computer Science

SP - 3

EP - 18

BT - SpringerBriefs in Computer Science

PB - Springer

ER -

The SIR model and identification of spreaders

Abstract

Publication series

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this