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 networksPreprint
Albert, R., Jeong, H., & Barabási, A.-Ĺ. (2000) · Cited by 6,467
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-citationNetwork structure and minimum degree
Seidman, S. B. (1983) · Social Networks · doi:10.1016/0378-8733(83)90028-x · Cited by 1,891
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
Bootstrap percolation on a Bethe lattice
Chalupa, J., Leath, P. L., & Reich, G. R. (1979) · Journal of Physics C: Solid State Physics · doi:10.1088/0022-3719/12/1/008 · Cited by 572
Clique Percolation in Random Networks
Derényi, I., Palla, G., & Vicsek, T. (2005) · Physical Review Letters · doi:10.1103/physrevlett.94.160202 · Cited by 558
Sudden Emergence of a Giantk-Core in a Random Graph
Pittel, B., Spencer, J., & Wormald, N. (1996) · Journal of Combinatorial Theory, Series B · doi:10.1006/jctb.1996.0036 · Cited by 437
Percolation critical exponents in scale-free networks
Cohen, R., ben-Avraham, D., & Havlin, S. (2002) · Physical Review E · doi:10.1103/physreve.66.036113 · Cited by 312
Large scale networks fingerprinting and visualization using the k-core decomposition
Alvarez-Hamelin, J. I., Dall’Asta, L., Barrat, A., & Vespignani, A. (2005) · Cited by 295
Metastability effects in bootstrap percolation
Aizenman, M., & Lebowitz, J. L. (1988) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/21/19/017 · Cited by 287
Thermodynamic limit of the first-order phase transition in the Kuramoto model
Pazó, D. (2005) · Physical Review E · doi:10.1103/physreve.72.046211 · Cited by 240
K-core decomposition of Internet graphs: hierarchies, self-similarity and measurement biases
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) · Networks & Heterogeneous Media · doi:10.3934/nhm.2008.3.371 · Cited by 224
Percolation and Epidemic Thresholds in Clustered Networks
Serrano, M. Á., & Boguñá, M. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.088701 · Cited by 188
k-core (bootstrap) percolation on complex networks: Critical phenomena and nonlocal effects
Goltsev, A. V., Dorogovtsev, S. N., & Mendes, J. F. F. (2006) · Physical Review E · doi:10.1103/physreve.73.056101 · Cited by 181
Self-citationThe onset of jamming as the sudden emergence of an infinite k -core cluster
Schwarz, J. M., Liu, A. J., & Chayes, L. (2006) · Europhysics Letters (EPL) · doi:10.1209/epl/i2005-10421-7 · Cited by 165
Clustering in complex networks. II. Percolation properties
Serrano, M. Á., & Boguñá, M. (2006) · Physical Review E · doi:10.1103/physreve.74.056115 · Cited by 126
Evolutionary cores of domain co-occurrence networks
Wuchty, S., & Almaas, E. (2005) · BMC Evolutionary Biology · doi:10.1186/1471-2148-5-24 · Cited by 105
Chatterjee, N., & Sitabhra Sinha, A. (2007) · Progress in brain research · doi:10.1016/s0079-6123(07)68012-1 · Cited by 96
Clustering in Complex Networks
Szabó, G., Alava, M. J., & Kertész, J. (2004) · Lecture notes in physics · doi:10.1007/978-3-540-44485-5_7 · Cited by 91
Bootstrap percolation transitions on real lattices
Kogut, P. M., & Leath, P. L. (1981) · Journal of Physics C Solid State Physics · doi:10.1088/0022-3719/14/22/013 · Cited by 86
-core architecture and -core percolation on complex networks
Dorogovtsev, S. N., Goltsev, A. V., & Mendes, J. F. F. (2006) · Physica D Nonlinear Phenomena · doi:10.1016/j.physd.2006.09.027 · Cited by 45
Self-citationk -core percolation in four dimensions
Giorgio Parisi, A., & Rizzo, T. (2008) · Physical Review E · doi:10.1103/physreve.78.022101 · Cited by 22
Rigidity percolation in a field
Moukarzel, C. F. (2003) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.68.056104 · Cited by 17
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
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.