Traffic-driven epidemic spreading in finite-size scale-free networks
Open accessThe DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
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. The vast majority of current theoretical approaches assumes that infections are transmitted as a reaction process from nodes to all neighbors. Here we adopt a different perspective and show that the epidemic incidence is shaped by traffic-flow conditions. Specifically, we consider the scenario in which epidemic pathways are defined and driven by flows. Through extensive numerical simulations and theoretical predictions, it is shown that the value of the epidemic threshold in scale-free networks depends directly on flow conditions, in particular on the first and second moments of the betweenness distribution given a routing protocol. We consider the scenarios in which the delivery capability of the nodes is bounded or unbounded. In both cases, the threshold values depend on the traffic and decrease as flow increases. Bounded delivery provokes the emergence of congestion, slowing down the spreading of the disease and setting a limit for the epidemic incidence. Our results provide a general conceptual framework for the understanding of spreading processes on complex networks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135 · cited 1×
“ßM^N® 9k = i + /w^e' [3]”
Complex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
Self-citationEpidemic Spreading in Scale-Free Networks
Pastor-Satorras, R., & Vespignani, A. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.3200 · Cited by 5,731 · cited 3×
“Following the heterogeneous mean-field approximation [4], the dynamical rate equations for the SIS model are The first term in Eq.”
BackgroundMethodResultSpread of epidemic disease on networks
Newman, M. E. J. (2002) · Physical Review E · doi:10.1103/physreve.66.016128 · Cited by 3,218 · cited 1×
“Scale-free networks [1, 2, 3] are characterized by the presence of hubs, which are responsible for several striking properties for the propagation of information, rumors or infections [4, 5, 6, 7, 8, 9].”
BackgroundClasses of small-world networks
Amaral, L. A. N., Scala, A., Barthélémy, M., & Stanley, H. E. (2000) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.200327197 · Cited by 3,051 · cited 1×
“Many networks observed in nature [1, 2], including those in society, biology and technology, have nodes that temporally interact only with a subset of its neighbors [10, 11].”
BackgroundCritical phenomena in complex networks
Dorogovtsev, S. N., Goltsev, A. V., & Mendes, J. F. F. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.1275 · Cited by 2,220 · cited 4×
“On the other hand, we also generate small-world, SF and highly clustered networks − all properties found in many real-world networks [1, 2] such as the Internet − using a class of recently developed network models [19, 20], in which nearby nodes in a hidden metric space are connected.”
BackgroundMethodInfluentialModelling disease outbreaks in realistic urban social networks
Eubank, S., Guclu, H., Anil Kumar, V. S., Marathe, M. V., Srinivasan, A., Toroczkai, Z., & Wang, N. (2004) · Nature · doi:10.1038/nature02541 · Cited by 2,090 · cited 2×
“Recent works have to some extend surmounted the problem of link concurrency through agent-based modeling approaches [14] or by explicitly implementing data-driven simulation ∗ Electronic address: yamir.moreno@gmail.com tools [17].”
BackgroundEvidence for dynamically organized modularity in the yeast protein–protein interaction network
Han, J.-D. J., Bertin, N., Hao, T., Goldberg, D. S., Berriz, G. F., Zhang, L. V., Dupuy, D., Walhout, A. J. M., Cusick, M. E., Roth, F. P., et al. (2004) · Nature · doi:10.1038/nature02555 · Cited by 1,798 · cited 1×
“For instance, hub proteins do not always interact with all their neighbor proteins at the same time [12], just as individuals in a social network [13] do not interact simultaneously with all of their acquaintances.”
BackgroundGuimerà, R., Mossa, S., Turtschi, A., & Amaral, L. A. N. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0407994102 · Cited by 1,762 · cited 1×
“For instance, in the context of air-transportation networks [17, 29], traffic-driven mechanisms of disease propagation could explain the observed differences in the impact of a disease during a year [30].”
BackgroundThe web of human sexual contacts
Liljeros, F., Edling, C., Amaral, L. A. N., Stanley, E., & Åberg, Y. (2001) · RePEc: Research Papers in Economics · Cited by 1,389
Cited by
Discrete-time Markov chain approach to contact-based disease spreading in complex networks
Gómez, S., Arenas, A., Borge-Holthoefer, J., Meloni, S., & Moreno, Y. (2010) · EPL (Europhysics Letters) · doi:10.1209/0295-5075/89/38009 · Cited by 571
Self-citationCoupled disease–behavior dynamics on complex networks: A review
Wang, Z., Andrews, M. A., Wu, Z.-X., Wang, L., & Bauch, C. T. (2015) · Physics of Life Reviews · doi:10.1016/j.plrev.2015.07.006 · Cited by 546
Percolation transition in dynamical traffic network with evolving critical bottlenecks
Li, D., Fu, B., Wang, Y., Lu, G., Berezin, Y., Stanley, H. E., & Havlin, S. (2015) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1419185112 · Cited by 475
Sustaining the Internet with hyperbolic mapping
Boguñá, M., Papadopoulos, F., & Krioukov, D. (2010) · Nature Communications · doi:10.1038/ncomms1063 · Cited by 463
Modeling human mobility responses to the large-scale spreading of infectious diseases
Meloni, S., Perra, N., Arenas, A., Gómez, S., Moreno, Y., & Vespignani, A. (2011) · Scientific Reports · doi:10.1038/srep00062 · Cited by 342
Self-citationEpidemic Propagation With Positive and Negative Preventive Information in Multiplex Networks
Wang, Z., Xia, C., Chen, Z., & Chen, G. (2021) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2019.2960605 · Cited by 289
Spatial epidemiology of networked metapopulation: an overview
Wang, L., & Li, X. (2014) · Chinese Science Bulletin · doi:10.1007/s11434-014-0499-8 · Cited by 197
Metadata
- Authors
- Meloni, S., Arenas, A., & Moreno, Y.
- Venue
- Proceedings of the National Academy of Sciences
- Published
- 2009-10-06
- Volume
- 106
- Issue
- 40
- Pages
- 16897-16902
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- OpenAlex
- W2160654341
- Cited by
- 184
- References
- 31
- FWCI
- 9.26
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.