The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
K-core decomposition of Internet graphs: hierarchies, self-similarity and measurement biases
Open accessAbstract
We consider the $k$-core decomposition of network models and Internet graphs at the autonomous system (AS) level. The k-core analysis allows to characterize networks beyond the degree distribution and uncover structural properties and hierarchies due to the specific architecture of the system. We compare the $k$-core structure obtained for AS graphs with those of several network models and discuss the differences and similarities with the real Internet architecture. The presence of biases and the incompleteness of the real maps are discussed and their effect on the $k$-core analysis is assessed with numerical experiments simulating biased exploration on a wide range of network models. We find that the $k$-core analysis provides an interesting characterization of the fluctuations and incompleteness of maps as well as information helping to discriminate the original underlying structure.
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
Dorogovtsev, S. N., & Mendes, J. F. F. (2003) · doi:10.1093/acprof:oso/9780198515906.001.0001 · Cited by 1,563
Cited by
Critical phenomena in complex networks
Dorogovtsev, S. N., Goltsev, A. V., & Mendes, J. F. F. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.1275 · Cited by 2,220
k-Core Organization of Complex Networks
Dorogovtsev, S. N., Goltsev, A. V., & Mendes, J. F. F. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.040601 · Cited by 709
Time-varying graphs and dynamic networks
Casteigts, A., Flocchini, P., Quattrociocchi, W., & Santoro, N. (2012) · International Journal of Parallel, Emergent and Distributed Systems · doi:10.1080/17445760.2012.668546 · Cited by 592
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
Fast algorithms for determining (generalized) core groups in social networks
Batagelj, V., & Zaveršnik, M. (2011) · Advances in Data Analysis and Classification · doi:10.1007/s11634-010-0079-y · Cited by 288
Metadata
- Authors
- Ignacio Alvarez-Hamelin, J., C. A. F. D. I., Dall'Asta, L., Barrat, A., Vespignani, A., A. S. I. C. F. T. P., L. (. D. C. 8., & S. O. I.
- Venue
- Networks & Heterogeneous Media
- Published
- 2008
- Volume
- 3
- Issue
- 2
- Pages
- 371-393
- ISSN
- 1556-1801 (ISSN-L)
- 1556-181X
- OpenAlex
- W2084668738
- Cited by
- 224
- References
- 1
- FWCI
- 6.29
- Type
- journal article
- Language
- en
- Open access
- bronze
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: K-core decomposition of Internet graphs: hierarchies, self-similarity and measurement biases. https://app.cochat.ai/papers/10.3934/nhm.2008.3.371
- The paper
- Ignacio Alvarez-Hamelin, J., C. A. F. D. I., Dall'Asta, L., Barrat, A., Vespignani, A., A. S. I. C. F. T. P., L. (. D. C. 8., & S. O. I. (2008). K-core decomposition of Internet graphs: hierarchies, self-similarity and measurement biases. Networks & Heterogeneous Media. https://doi.org/10.3934/nhm.2008.3.371
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.