Identifying the starting point of a spreading process in complex networks
Open accessThe DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Abstract
When dealing with the dissemination of epidemics, one important question that can be asked is the location where the contamination began. In this paper, we analyze three spreading schemes and propose and validate an effective methodology for the identification of the source nodes. The method is based on the calculation of the centrality of the nodes on the sampled network, expressed here by degree, betweenness, closeness, and eigenvector centrality. We show that the source node tends to have the highest measurement values. The potential of the methodology is illustrated with respect to three theoretical complex network models as well as a real-world network, the email network of the University Rovira i Virgili.
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
Centrality in social networks conceptual clarification
Freeman, L. C. (1978) · Social Networks · doi:10.1016/0378-8733(78)90021-7 · Cited by 17,062
A Set of Measures of Centrality Based on Betweenness
Freeman, L. C. (1977) · Sociometry · doi:10.2307/3033543 · Cited by 10,295
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534
Newman, M. (2010) · doi:10.1093/acprof:oso/9780199206650.001.0001 · Cited by 6,595 · cited 3×
“Closeness and betweenness Let dij be the length of the shortest (geodesic) path between nodes i and j, then the mean geodesic distance [20] with respect to node i is”
BackgroundInfluentialError and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-Ĺ. (2000) · RePEc: Research Papers in Economics · Cited by 6,469
Epidemic 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 1×
“…is also directly related to several important processes taking place in complex systems, such as the dissemination of a biological or virtual virus [6, 7], the spreading of a disease in an organism [8], the spread of the news about an event [9], as well as any other process underlain by diffusion…”
BackgroundSpread of epidemic disease on networks
Newman, M. E. J. (2002) · Physical Review E · doi:10.1103/physreve.66.016128 · Cited by 3,218
Identification of influential spreaders in complex networks
Kitsak, M., Gallos, L. K., Havlin, S., Liljeros, F., Muchnik, L., Stanley, H. E., & Makse, H. A. (2010) · Nature Physics · doi:10.1038/nphys1746 · Cited by 3,212
The Centrality Index of a Graph
Sabidussi, G. (1966) · Psychometrika · doi:10.1007/bf02289527 · Cited by 2,476
Cited by
Epidemic processes in complex networks
Pastor-Satorras, R., Castellano, C., Van Mieghem, P., & Vespignani, A. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.925 · Cited by 3,697
Ranking spreaders by decomposing complex networks
Zeng, A., & Zhang, C.-J. (2013) · Physics Letters A · doi:10.1016/j.physleta.2013.02.039 · Cited by 448
Inferring the origin of an epidemic with a dynamic message-passing algorithm
Lokhov, A. Y., Mézard, M., Ohta, H., & Zdeborová, L. (2014) · Physical Review E · doi:10.1103/physreve.90.012801 · Cited by 322
Bayesian Inference of Epidemics on Networks via Belief Propagation
Altarelli, F., Braunstein, A., Dall’Asta, L., Lage-Castellanos, A., & Zecchina, R. (2014) · Physical Review Letters · doi:10.1103/physrevlett.112.118701 · Cited by 218
A Hybrid Approach for Fake News Detection in Twitter Based on User Features and Graph Embedding
Hamdi, T., Slimi, H., Bounhas, I., & Slimani, Y. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-36987-3_17 · Cited by 70
Metadata
- Authors
- Comin, C. H., & da Fontoura Costa, L.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2011-11-15
- Volume
- 84
- Issue
- 5
- Pages
- 056105-056105
- ISSN
- 1539-3755 (ISSN-L)
- 1550-2376
- OpenAlex
- W3023194939
- Cited by
- 196
- References
- 30
- FWCI
- 5.73
- 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.