The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Identifying influential spreaders by weighted LeaderRank
Open accessAbstract
Identifying influential spreaders is crucial for understanding and controlling spreading processes on social networks. Via assigning degree-dependent weights onto links associated with the ground node, we proposed a variant to a recent ranking algorithm named LeaderRank (Lu et al., 2011). According to the simulations on the standard SIR model, the weighted LeaderRank performs better than LeaderRank in three aspects: (i) the ability to find out more influential spreaders; (ii) the higher tolerance to noisy data; and (iii) the higher robustness to intentional attacks.
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
Centrality in social networks conceptual clarification
Freeman, L. C. (1978) · Social Networks · doi:10.1016/0378-8733(78)90021-7 · Cited by 17,062
The anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
Some Unique Properties of Eigenvector Centrality
Bonacich, P. (2007) · Social Networks · doi:10.1016/j.socnet.2007.04.002 · Cited by 1,572 · cited 1×
“A number of centrality indices have been proposed to address this problem, such as degree centrality, closeness centrality [15], betweenness centrality [16], and eigenvector centrality [17].”
BackgroundIdentifying influential and susceptible members of social networks
Aral, S., & Walker, D. (2012) · Science · doi:10.1126/science.1215842 · Cited by 1,047
Cited by
Identifying influential spreaders in complex networks based on gravity formula
Ma, L.-L., Ma, C., Zhang, H.-F., & Wang, B.-H. (2016) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2015.12.162 · Cited by 367
Identifying Influential Nodes in Large-Scale Directed Networks: The Role of Clustering
Chen, D.-B., Gao, H., Lü, L., & Zhou, T. (2013) · PLoS ONE · doi:10.1371/journal.pone.0077455 · Cited by 364
Self-citationInformation cascades in complex networks
Jalili, M., & Perc, M. (2017) · Journal of Complex Networks · doi:10.1093/comnet/cnx019 · Cited by 248
Metadata
- Authors
- Li, Q., Zhou, T., Lü, L., & Chen, D.
- Venue
- Physica A: Statistical Mechanics and its Applications
- Publisher
- Elsevier BV
- Published
- 2014-06
- Volume
- 404
- Pages
- 47-55
- ISSN
- 0378-4371 (ISSN-L)
- OpenAlex
- W1971941321
- Cited by
- 248
- References
- 4
- FWCI
- 13.84
- 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: Identifying influential spreaders by weighted LeaderRank. https://app.cochat.ai/papers/10.1016/j.physa.2014.02.041
- The paper
- Li, Q., Zhou, T., Lü, L., & Chen, D. (2014). Identifying influential spreaders by weighted LeaderRank. Physica A: Statistical Mechanics and its Applications. https://doi.org/10.1016/j.physa.2014.02.041
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.