The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Sudden Emergence of a Giantk-Core in a Random Graph
Open accessAbstract
Thek-core of a graph is the largest subgraph with minimum degree at leastk. For the Erdős–Rényi random graphG(n, m) onnvertives, withmedges, it is known that a giant 2-core grows simultaneously with a giant component, that is, whenmis close ton/2. We show that fork⩾3, with high probability, a giantk-core appears suddenly whenmreachesckn/2; hereck=minλ>0 λ/πk(λ) andπk(λ)=P{Poisson(λ)⩾k−1}. In particular,c3≈3.35. We also demonstrate that, unlike the 2-core, when ak-core appears for the first time it is very likely to be giant, of size ≈pk(λk) n. Hereλkis the minimum point ofλ/πk(λ) andpk(λk)=P{Poisson(λk)⩾k}. Fork=3, for instance, the newborn 3-core contains about 0.27nvertices. Our proofs are based on the probabilistic analysis of an edge deletion algorithm that always find ak-core if the graph has one.
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
An introduction to probability theory and its applications
(1958) · Journal of the Franklin Institute · doi:10.1016/0016-0032(58)90688-4 · Cited by 29,269
Bollobás, B. (1985) · Cited by 6,196
An Introduction to Probability Theory.
Fristedt, B., & Moran, P. A. P. (1986) · Journal of the American Statistical Association · doi:10.2307/2288022 · Cited by 3,300
Probability: Theory and Examples.
Prewitt, K., & Durrett, R. (1992) · Journal of the American Statistical Association · doi:10.2307/2290301 · Cited by 3,085
A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs
Bollobás, B. (1980) · European Journal of Combinatorics · doi:10.1016/s0195-6698(80)80030-8 · Cited by 1,151
The asymptotic number of labeled graphs with given degree sequences
Bender, E. A., & Canfield, E. R. (1978) · Journal of Combinatorial Theory, Series A · doi:10.1016/0097-3165(78)90059-6 · Cited by 970
Differential Equations for Random Processes and Random Graphs
Wormald, N. (1995) · The Annals of Applied Probability · doi:10.1214/aoap/1177004612 · Cited by 401
Self-citationComponent behavior near the critical point of the random graph process
Łuczak, T. (1990) · Random Structures & Algorithms · doi:10.1002/rsa.3240010305 · Cited by 215
The transitive closure of a random digraph
Karp, R. M. (1990) · Random Structures & Algorithms · doi:10.1002/rsa.3240010106 · Cited by 215
Asymptotic enumeration by degree sequence of graphs with degreeso(n 1/2)
McKay, B. D., & Wormald, N. C. (1991) · Combinatorica · doi:10.1007/bf01275671 · Cited by 199
Self-citation
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
The power of two choices in randomized load balancing
Mitzenmacher, M. (2001) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.963420 · Cited by 1,399
Efficient erasure correcting codes
Luby, M. G., Mitzenmacher, M., Shokrollahi, M. A., & Spielman, D. A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910575 · Cited by 1,180
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
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
Frieze, A., & Karoński, M. (2015) · doi:10.1017/cbo9781316339831 · Cited by 576
Understanding brain networks and brain organization
Pessoa, L. (2014) · Physics of Life Reviews · doi:10.1016/j.plrev.2014.03.005 · Cited by 464
“8 One way to evaluate this is to use k-shell decomposition [131].”
MethodRecent advances in percolation theory and its applications
Saberi, A. A. (2015) · Physics Reports · doi:10.1016/j.physrep.2015.03.003 · Cited by 438
Percolation 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
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
Moore, C., & Mertens, S. (2011) · doi:10.1093/acprof:oso/9780199233212.001.0001 · Cited by 347
Selecting publication keywords for domain analysis in bibliometrics: A comparison of three methods
Chen, G., & Xiao, L. (2016) · Journal of Informetrics · doi:10.1016/j.joi.2016.01.006 · Cited by 332
Phase transitions in the coloring of random graphs
Zdeborová, L., & Krząkała, F. (2007) · Physical Review E · doi:10.1103/physreve.76.031131 · 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
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
Two Solutions to Diluted p-Spin Models and XORSAT Problems
Mézard, M., Ricci-Tersenghi, F., & Zecchina, R. (2003) · Journal of Statistical Physics · doi:10.1023/a:1022886412117 · Cited by 256
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
- Pittel, B., Spencer, J., & Wormald, N.
- Venue
- Journal of Combinatorial Theory, Series B
- Publisher
- Elsevier BV
- Published
- 1996-05
- Volume
- 67
- Issue
- 1
- Pages
- 111-151
- ISSN
- 0095-8956 (ISSN-L)
- OpenAlex
- W2065663455
- Cited by
- 437
- References
- 17
- FWCI
- 6.91
- Type
- journal article
- Language
- en
- Open access
- hybrid
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.