The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Improving the accuracy of the k-shell method by removing redundant links: From a perspective of spreading dynamics
Open accessAbstract
Recent study shows that the accuracy of the k-shell method in determining node coreness in a spreading process is largely impacted due to the existence of core-like group, which has a large k-shell index but a low spreading efficiency. Based on the analysis of the structure of core-like groups in real-world networks, we discover that nodes in the core-like group are mutually densely connected with very few out-leaving links from the group. By defining a measure of diffusion importance for each edge based on the number of out-leaving links of its both ends, we are able to identify redundant links in the spreading process, which have a relatively low diffusion importance but lead to form the locally densely connected core-like group. After filtering out the redundant links and applying the k-shell method to the residual network, we obtain a renewed coreness ksfor each node which is a more accurate index to indicate its location importance and spreading influence in the original network. Moreover, we find that the performance of the ranking algorithms based on the renewed coreness are also greatly enhanced. Our findings help to more accurately decompose the network core structure and identify influential nodes in spreading processes.
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
Gephi: An Open Source Software for Exploring and Manipulating Networks
Bastian, M., Heymann, S., & Jacomy, M. (2009) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v3i1.13937 · Cited by 11,675
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
Newman, M. (2010) · doi:10.1093/acprof:oso/9780199206650.001.0001 · Cited by 6,595
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
Measuring user influence in twitter: The million follower fallacy
Cha, M., Haddadi, H., Benevenuto, F., & Gummadi, K. (2010) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v4i1.14033 · Cited by 3,022
Modeling Users' Activity on Twitter Networks: Validation of Dunbar's Number
Gonçalves, B., Perra, N., & Vespignani, A. (2011) · PLoS ONE · doi:10.1371/journal.pone.0022656 · Cited by 638
The dynamics of protest recruitment through an online network
González-Bailón, S., Borge-Holthoefer, J., Rivero, A., & Moreno, Y. (2011) · Scientific Reports · doi:10.1038/srep00197 · Cited by 571
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 a set of influential spreaders in complex networks
Zhang, J.-X., Chen, D.-B., Dong, Q., & Zhao, Z.-D. (2016) · Scientific Reports · doi:10.1038/srep27823 · Cited by 320
Metadata
- Authors
- Liu, Y., Tang, M., Zhou, T., & Do, Y.
- Venue
- Scientific Reports
- Published
- 2015-08-17
- Volume
- 5
- Issue
- 1
- Pages
- 13172-13172
- ISSN
- 2045-2322 (ISSN-L)
- OpenAlex
- W2963568110
- Cited by
- 160
- References
- 7
- FWCI
- 10.90
- Type
- journal article
- Language
- en
- Open access
- gold
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: Improving the accuracy of the k-shell method by removing redundant links: From a perspective of spreading dynamics. https://app.cochat.ai/papers/10.1038/srep13172
- The paper
- Liu, Y., Tang, M., Zhou, T., & Do, Y. (2015). Improving the accuracy of the k-shell method by removing redundant links: From a perspective of spreading dynamics. Scientific Reports. https://doi.org/10.1038/srep13172
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.