The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
A k-shell decomposition method for weighted networks
Open accessAbstract
We present a generalized method for calculating the k -shell structure of weighted networks. The method takes into account both the weight and the degree of a network, in such a way that in the absence of weights we resume the shell structure obtained by the classic k -shell decomposition. In the presence of weights, we show that the method is able to partition the network in a more refined way, without the need of any arbitrary threshold on the weight values. Furthermore, by simulating spreading processes using the susceptible-infectious-recovered model in four different weighted real-world networks, we show that the weighted k -shell decomposition method ranks the nodes more accurately, by placing nodes with higher spreading potential into shells closer to the core. In addition, we demonstrate our new method on a real economic network and show that the core calculated using the weighted k -shell method is more meaningful from an economic perspective when compared with the unweighted one.
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
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
Network motifs: simple building blocks of complex networks.
Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., & Alon, U. (2002) · Science · doi:10.1126/science.298.5594.824 · Cited by 7,368
Newman, M. (2010) · doi:10.1093/acprof:oso/9780199206650.001.0001 · Cited by 6,595
The structure of the nervous system of the nematode Caenorhabditis elegans
White, J. G., Southgate, E., Thomson, J. N., & Brenner, S. (1986) · Philosophical Transactions of the Royal Society of London. B, Biological Sciences · doi:10.1098/rstb.1986.0056 · Cited by 5,589 · cited 2×
“This network was compiled by D. Watts and S. Strogatz [52] using the original experimental data by White et al [53].”
MethodStatistical physics of social dynamics
Castellano, C., Fortunato, S., & Loreto, V. (2009) · Reviews of Modern Physics · doi:10.1103/revmodphys.81.591 · Cited by 4,119
Dynamical Processes on Complex Networks
Barrat, A., Barthélemy, M., & Vespignani, A. (2008) · doi:10.1017/cbo9780511791383 · Cited by 2,704
Barabási, A.-L., & Bonabeau, E. (2003) · Scientific American · doi:10.1038/scientificamerican0503-60 · Cited by 2,494
The Network of Global Corporate Control
Vitali, S., Glattfelder, J. B., & Battiston, S. (2011) · PLoS ONE · doi:10.1371/journal.pone.0025995 · Cited by 827
Biological networks: the tinkerer as an engineer
Alon, U. (2003) · Science · doi:10.1126/science.1089072 · Cited by 706
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
Task-Based Core-Periphery Organization of Human Brain Dynamics
Bassett, D. S., Wymbs, N. F., Rombach, M. P., Porter, M. A., Mucha, P. J., & Grafton, S. T. (2013) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1003171 · Cited by 356
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
Corruption risk in contracting markets: a network science perspective
Wachs, J., Fazekas, M., & Kertész, J. (2021) · International Journal of Data Science and Analytics · doi:10.1007/s41060-019-00204-1 · Cited by 73
Metadata
- Authors
- Garas, A., Schweitzer, F., & Havlin, S.
- Venue
- New Journal of Physics
- Publisher
- IOP Publishing
- Published
- 2012-08-24
- Volume
- 14
- Issue
- 8
- Pages
- 083030
- ISSN
- 1367-2630 (ISSN-L)
- OpenAlex
- W2141806644
- Cited by
- 280
- References
- 10
- FWCI
- 9.00
- 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: A k-shell decomposition method for weighted networks. https://app.cochat.ai/papers/10.1088/1367-2630/14/8/083030
- The paper
- Garas, A., Schweitzer, F., & Havlin, S. (2012). A k-shell decomposition method for weighted networks. New Journal of Physics. https://doi.org/10.1088/1367-2630/14/8/083030
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.