The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Traffic-driven epidemic spreading in finite-size scale-free networks
Open accessAbstract
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.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Classes 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
How Viruses Spread Among Computers and People
Lloyd, A. L., & May, R. M. (2001) · Science · doi:10.1126/science.1061076 · Cited by 661
Navigability of complex networks
Boguñá, M., Krioukov, D., & Claffy, K. C. (2009) · Nature Physics · doi:10.1038/nphys1130 · Cited by 486
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-citation
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
- 3
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Traffic-driven epidemic spreading in finite-size scale-free networks. https://app.cochat.ai/papers/10.1073/pnas.0907121106
- The paper
- Meloni, S., Arenas, A., & Moreno, Y. (2009). Traffic-driven epidemic spreading in finite-size scale-free networks. Proceedings of the National Academy of Sciences. https://doi.org/10.1073/pnas.0907121106
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.