The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
k-Core Organization of Complex Networks
Open accessAbstract
We analytically describe the architecture of randomly damaged uncorrelated networks as a set of successively enclosed substructures--k-cores. The k-core is the largest subgraph where vertices have at least k interconnections. We find the structure of k-cores, their sizes, and their birthpoints--the bootstrap percolation thresholds. We show that in networks with a finite mean number zeta2 of the second-nearest neighbors, the emergence of a k-core is a hybrid phase transition. In contrast, if zeta2 diverges, the networks contain an infinite sequence of k-cores which are ultrarobust against random damage.
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
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
Community structure in social and biological networks
Girvan, M., & Newman, M. E. J. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.122653799 · Cited by 15,502
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
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-Ĺ. (2000) · RePEc: Research Papers in Economics · Cited by 6,469
Uncovering the overlapping community structure of complex networks in nature and society
Palla, G., Derényi, I., Farkas, I., & Vicsek, T. (2005) · Nature · doi:10.1038/nature03607 · Cited by 5,373
Random graphs with arbitrary degree distributions and their applications
Newman, M. E. J., Strogatz, S. H., & Watts, D. J. (2001) · Physical Review E · doi:10.1103/physreve.64.026118 · Cited by 3,648
Dorogovtsev, S. N., & Mendes, J. F. F. (2002) · Advances in Physics · doi:10.1080/00018730110112519 · Cited by 3,171
Self-citationNetwork Robustness and Fragility: Percolation on Random Graphs
Callaway, D. S., Newman, M. E. J., Strogatz, S. H., & Watts, D. J. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.5468 · Cited by 2,480
Resilience of the Internet to Random Breakdowns
Cohen, R., Erez, K., ben-Avraham, D., & Havlin, S. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.4626 · Cited by 2,391
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
Self-citation
Cited by
Characterization of complex networks: A survey of measurements
Costa, L. D. F., Rodrigues, F. A., Travieso, G., & Villas Boas, P. R. (2007) · Advances in Physics · doi:10.1080/00018730601170527 · Cited by 2,475
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
Self-citationLeskovec, J., Lang, K. J., Dasgupta, A., & Mahoney, M. W. (2009) · Internet Mathematics · doi:10.1080/15427951.2009.10129177 · Cited by 1,872
Vital nodes identification in complex networks
Lü, L., Chen, D., Ren, X.-L., Zhang, Q.-M., Zhang, Y.-C., & Zhou, T. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.06.007 · Cited by 1,183
The Kuramoto model in complex networks
Rodrigues, F. A., Peron, T. K. D., Ji, P., & Kurths, J. (2016) · Physics Reports · doi:10.1016/j.physrep.2015.10.008 · Cited by 1,040
Analyzing and modeling real-world phenomena with complex networks: a survey of applications
Costa, L. D. F., Oliveira, O. N., Travieso, G., Rodrigues, F. A., Villas Boas, P. R., Antiqueira, L., Viana, M. P., & Correa Rocha, L. E. (2011) · Advances in Physics · doi:10.1080/00018732.2011.572452 · Cited by 800
A model of Internet topology using k-shell decomposition
Carmi, S., Havlin, S., Kirkpatrick, S., Shavitt, Y., & Shir, E. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0701175104 · Cited by 760
The H-index of a network node and its relation to degree and coreness
Lü, L., Zhou, T., Zhang, Q.-M., & Stanley, H. E. (2016) · Nature Communications · doi:10.1038/ncomms10168 · Cited by 690
Robustness and resilience of complex networks
Artime, O., Grassia, M., De Domenico, M., Gleeson, J. P., Makse, H. A., Mangioni, G., Perc, M., & Radicchi, F. (2024) · Nature Reviews Physics · doi:10.1038/s42254-023-00676-y · Cited by 672
Identifying and ranking influential spreaders in complex networks by neighborhood coreness
Bae, J., & Kim, S. (2014) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2013.10.047 · Cited by 564
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
Recent advances in percolation theory and its applications
Saberi, A. A. (2015) · Physics Reports · doi:10.1016/j.physrep.2015.03.003 · Cited by 438
Avalanche Collapse of Interdependent Networks
Baxter, G. J., Dorogovtsev, S. N., Goltsev, A. V., & Mendes, J. F. F. (2012) · Physical Review Letters · doi:10.1103/physrevlett.109.248701 · Cited by 376
Self-citationPercolation on complex networks: Theory and application
Li, M., Liu, R.-R., Lü, L., Hu, M.-B., Xu, S., & Zhang, Y.-C. (2021) · Physics Reports · doi:10.1016/j.physrep.2020.12.003 · Cited by 365
Explosive transitions in complex networks’ structure and dynamics: Percolation and synchronization
Boccaletti, S., Almendral, J. A., Guan, S., Leyva, I., Liu, Z., Sendiña-Nadal, I., Wang, Z., & Zou, Y. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.10.004 · Cited by 363
Searching for superspreaders of information in real-world social media
Pei, S., Muchnik, L., Andrade, Zheng, Z., & Makse, H. A. (2014) · Scientific Reports · doi:10.1038/srep05547 · Cited by 362
Signal propagation in complex networks
Ji, P., Ye, J., Mu, Y., Lin, W., Tian, Y., Hens, C., Perc, M., Tang, Y., Sun, J., & Kurths, J. (2023) · Physics Reports · doi:10.1016/j.physrep.2023.03.005 · Cited by 360
Small vulnerable sets determine large network cascades in power grids
Yang, Y., Nishikawa, T., & Motter, A. E. (2017) · Science · doi:10.1126/science.aan3184 · Cited by 348
Kovács, I. A., Palotai, R., Szalay, M. S., & Csermely, P. (2010) · PLoS ONE · doi:10.1371/journal.pone.0012528 · Cited by 338
Camacho, D., Panizo-LLedot, Á., Bello-Orgaz, G., Gonzalez-Pardo, A., & Cambria, E. (2020) · Information Fusion · doi:10.1016/j.inffus.2020.05.009 · Cited by 329
Effective community search for large attributed graphs
Fang, Y., Cheng, R., Luo, S., & Hu, J. (2016) · Proceedings of the VLDB Endowment · doi:10.14778/2994509.2994538 · Cited by 317
Analysis of the Chinese Airline Network as multi-layer networks
Du, W.-B., Zhou, X.-L., Lordan, O., Wang, Z., Zhao, C., & Zhu, Y.-B. (2016) · Transportation Research Part E: Logistics and Transportation Review · doi:10.1016/j.tre.2016.03.009 · Cited by 306
Local search of communities in large graphs
Cui, W., Xiao, Y., Wang, H., & Wang, W. (2014) · Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2588555.2612179 · Cited by 299
Explosive Percolation Transition is Actually Continuous
da Costa, R. A., Dorogovtsev, S. N., Goltsev, A. V., & Mendes, J. F. F. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.255701 · Cited by 287
Self-citationA k-shell decomposition method for weighted networks
Garas, A., Schweitzer, F., & Havlin, S. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/8/083030 · Cited by 280
Anatomy of an online misinformation network
Shao, C., Hui, P.-M., Wang, L., Jiang, X., Flammini, A., Menczer, F., & Ciampaglia, G. L. (2018) · PLOS ONE · doi:10.1371/journal.pone.0196087 · Cited by 278
Bianconi, G. (2009) · Physical Review E · doi:10.1103/physreve.79.036114 · Cited by 273
Efficient core decomposition in massive networks
Cheng, J., Ke, Y., Chu, S., & Ozsu, M. T. (2011) · 2011 IEEE 27th International Conference on Data Engineering · doi:10.1109/icde.2011.5767911 · Cited by 266
Ranking the spreading influence in complex networks
Liu, J.-G., Ren, Z.-M., & Guo, Q. (2013) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2013.04.037 · Cited by 258
Consistency-based thresholding of the human connectome
Roberts, J. A., Perry, A., Roberts, G., Mitchell, P. B., & Breakspear, M. (2017) · NeuroImage · doi:10.1016/j.neuroimage.2016.09.053 · Cited by 189
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
Insights into bootstrap percolation: Its equivalence with k-core percolation and the giant component
Di Muro, M. A., Valdez, L. D., Stanley, H. E., Buldyrev, S. V., & Braunstein, L. A. (2019) · Physical Review E · doi:10.1103/physreve.99.022311 · Cited by 18
How the brain transitions from conscious to subliminal perception
Arese Lucini, F., Del Ferraro, G., Sigman, M., & Makse, H. A. (2019) · Neuroscience · doi:10.1016/j.neuroscience.2019.03.047 · Cited by 3
“Several other statistical markers of networks have been investigated and recently the idea of k-core [32,30] has received substantial attention in network analysis since it provides a topological notion of the structural skeleton of a network [17,8,1,21,24].”
Background
Metadata
- Authors
- Dorogovtsev, S. N., Goltsev, A. V., & Mendes, J. F. F.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2006-02-02
- Volume
- 96
- Issue
- 4
- Pages
- 040601-040601
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W1970381667
- Cited by
- 709
- References
- 31
- FWCI
- 9.34
- 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.