Modeling epidemic spreading in complex networks: Concurrency and traffic

Sandro Meloni, Alex Arenas, Sergio Gómez, Javier Borge-Holthoefer, Yamir Moreno

Research output: Chapter in Book/Report/Conference proceedingChapter

8 Citations (Scopus)

Abstract

The study of complex networks sheds light on the relation between the structure and function of complex systems. One remarkable result is the absence of an epidemic threshold in infinite-size scale-free networks, which implies that any infection will perpetually propagate regardless of the spreading rate. However, realworld networks are finite and experience indicates that infections do have a finite lifetime. In this chapter, we will provide with two new approaches to cope with the problem of concurrency and traffic in the spread of epidemics. We show that the epidemic incidence is shaped by contact flow or traffic conditions. Contrary to the classical assumption that infections are transmitted as a diffusive process from nodes to all neighbors,we instead consider the scenario in which epidemic pathways are defined and driven by flows. Extensive numerical simulations and theoretical predictions show that whether a threshold exists or not depends directly on contact flow conditions. Two extreme cases are identified. In the case of low traffic, an epidemic threshold shows up, while for very intense flow, no epidemic threshold appears. In this way, the classical mean-field theory for epidemic spreading in scale free networks is recovered as a particular case of the proposed approach. Our results explain why some infections persist with low prevalence in scale-free networks, and provide a novel conceptual framework to understand dynamical processes on complex networks.

Original languageEnglish
Title of host publicationSpringer Optimization and Its Applications
PublisherSpringer International Publishing
Pages435-462
Number of pages28
Volume57
DOIs
Publication statusPublished - 2012
Externally publishedYes

Publication series

NameSpringer Optimization and Its Applications
Volume57
ISSN (Print)19316828
ISSN (Electronic)19316836

Fingerprint

Epidemic Spreading
Concurrency
Complex Networks
Traffic
Infection
Scale-free Networks
Modeling
Contact
Mean-field Theory
Pathway
Complex Systems
Incidence
Lifetime
Extremes
Imply
Numerical Simulation
Scenarios
Prediction
Vertex of a graph

ASJC Scopus subject areas

  • Control and Optimization

Cite this

Meloni, S., Arenas, A., Gómez, S., Borge-Holthoefer, J., & Moreno, Y. (2012). Modeling epidemic spreading in complex networks: Concurrency and traffic. In Springer Optimization and Its Applications (Vol. 57, pp. 435-462). (Springer Optimization and Its Applications; Vol. 57). Springer International Publishing. https://doi.org/10.1007/978-1-4614-0754-6_15

Modeling epidemic spreading in complex networks : Concurrency and traffic. / Meloni, Sandro; Arenas, Alex; Gómez, Sergio; Borge-Holthoefer, Javier; Moreno, Yamir.

Springer Optimization and Its Applications. Vol. 57 Springer International Publishing, 2012. p. 435-462 (Springer Optimization and Its Applications; Vol. 57).

Research output: Chapter in Book/Report/Conference proceedingChapter

Meloni, S, Arenas, A, Gómez, S, Borge-Holthoefer, J & Moreno, Y 2012, Modeling epidemic spreading in complex networks: Concurrency and traffic. in Springer Optimization and Its Applications. vol. 57, Springer Optimization and Its Applications, vol. 57, Springer International Publishing, pp. 435-462. https://doi.org/10.1007/978-1-4614-0754-6_15
Meloni S, Arenas A, Gómez S, Borge-Holthoefer J, Moreno Y. Modeling epidemic spreading in complex networks: Concurrency and traffic. In Springer Optimization and Its Applications. Vol. 57. Springer International Publishing. 2012. p. 435-462. (Springer Optimization and Its Applications). https://doi.org/10.1007/978-1-4614-0754-6_15
Meloni, Sandro ; Arenas, Alex ; Gómez, Sergio ; Borge-Holthoefer, Javier ; Moreno, Yamir. / Modeling epidemic spreading in complex networks : Concurrency and traffic. Springer Optimization and Its Applications. Vol. 57 Springer International Publishing, 2012. pp. 435-462 (Springer Optimization and Its Applications).
@inbook{17741409d3bc425fbac1315f0d6b717a,
title = "Modeling epidemic spreading in complex networks: Concurrency and traffic",
abstract = "The study of complex networks sheds light on the relation between the structure and function of complex systems. One remarkable result is the absence of an epidemic threshold in infinite-size scale-free networks, which implies that any infection will perpetually propagate regardless of the spreading rate. However, realworld networks are finite and experience indicates that infections do have a finite lifetime. In this chapter, we will provide with two new approaches to cope with the problem of concurrency and traffic in the spread of epidemics. We show that the epidemic incidence is shaped by contact flow or traffic conditions. Contrary to the classical assumption that infections are transmitted as a diffusive process from nodes to all neighbors,we instead consider the scenario in which epidemic pathways are defined and driven by flows. Extensive numerical simulations and theoretical predictions show that whether a threshold exists or not depends directly on contact flow conditions. Two extreme cases are identified. In the case of low traffic, an epidemic threshold shows up, while for very intense flow, no epidemic threshold appears. In this way, the classical mean-field theory for epidemic spreading in scale free networks is recovered as a particular case of the proposed approach. Our results explain why some infections persist with low prevalence in scale-free networks, and provide a novel conceptual framework to understand dynamical processes on complex networks.",
author = "Sandro Meloni and Alex Arenas and Sergio G{\'o}mez and Javier Borge-Holthoefer and Yamir Moreno",
year = "2012",
doi = "10.1007/978-1-4614-0754-6_15",
language = "English",
volume = "57",
series = "Springer Optimization and Its Applications",
publisher = "Springer International Publishing",
pages = "435--462",
booktitle = "Springer Optimization and Its Applications",

}

TY - CHAP

T1 - Modeling epidemic spreading in complex networks

T2 - Concurrency and traffic

AU - Meloni, Sandro

AU - Arenas, Alex

AU - Gómez, Sergio

AU - Borge-Holthoefer, Javier

AU - Moreno, Yamir

PY - 2012

Y1 - 2012

N2 - The study of complex networks sheds light on the relation between the structure and function of complex systems. One remarkable result is the absence of an epidemic threshold in infinite-size scale-free networks, which implies that any infection will perpetually propagate regardless of the spreading rate. However, realworld networks are finite and experience indicates that infections do have a finite lifetime. In this chapter, we will provide with two new approaches to cope with the problem of concurrency and traffic in the spread of epidemics. We show that the epidemic incidence is shaped by contact flow or traffic conditions. Contrary to the classical assumption that infections are transmitted as a diffusive process from nodes to all neighbors,we instead consider the scenario in which epidemic pathways are defined and driven by flows. Extensive numerical simulations and theoretical predictions show that whether a threshold exists or not depends directly on contact flow conditions. Two extreme cases are identified. In the case of low traffic, an epidemic threshold shows up, while for very intense flow, no epidemic threshold appears. In this way, the classical mean-field theory for epidemic spreading in scale free networks is recovered as a particular case of the proposed approach. Our results explain why some infections persist with low prevalence in scale-free networks, and provide a novel conceptual framework to understand dynamical processes on complex networks.

AB - The study of complex networks sheds light on the relation between the structure and function of complex systems. One remarkable result is the absence of an epidemic threshold in infinite-size scale-free networks, which implies that any infection will perpetually propagate regardless of the spreading rate. However, realworld networks are finite and experience indicates that infections do have a finite lifetime. In this chapter, we will provide with two new approaches to cope with the problem of concurrency and traffic in the spread of epidemics. We show that the epidemic incidence is shaped by contact flow or traffic conditions. Contrary to the classical assumption that infections are transmitted as a diffusive process from nodes to all neighbors,we instead consider the scenario in which epidemic pathways are defined and driven by flows. Extensive numerical simulations and theoretical predictions show that whether a threshold exists or not depends directly on contact flow conditions. Two extreme cases are identified. In the case of low traffic, an epidemic threshold shows up, while for very intense flow, no epidemic threshold appears. In this way, the classical mean-field theory for epidemic spreading in scale free networks is recovered as a particular case of the proposed approach. Our results explain why some infections persist with low prevalence in scale-free networks, and provide a novel conceptual framework to understand dynamical processes on complex networks.

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

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

U2 - 10.1007/978-1-4614-0754-6_15

DO - 10.1007/978-1-4614-0754-6_15

M3 - Chapter

AN - SCOPUS:84978886772

VL - 57

T3 - Springer Optimization and Its Applications

SP - 435

EP - 462

BT - Springer Optimization and Its Applications

PB - Springer International Publishing

ER -