arXiv · cond-mat/0509102
k-core organization of complex networks
Abstract
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 birth points -- the bootstrap percolation thresholds. We show that in networks with a finite mean number z_2 of the second-nearest neighbors, the emergence of a k-core is a hybrid phase transition. In contrast, if z_2 diverges, the networks contain an infinite sequence of k-cores which are ultra-robust against random damage.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
S. N. Dorogovtsev, A. V. Goltsev, J. F. F. Mendes. 2006-02-28. k-core organization of complex networks. https://doi.org/10.1103/physrevlett.96.040601
Cite the original work for its findings. Save a collection to share your selection of sources.