K-core Organization of Complex Networks

@article{Dorogovtsev2006KcoreOO,
  title={K-core Organization of Complex Networks},
  author={Sergey N. Dorogovtsev and Alexander V. Goltsev and Jos{\'e} F. F. Mendes},
  journal={Physical review letters},
  year={2006},
  volume={96 4},
  pages={
          040601
        }
}
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… 
View on PubMed
arxiv.org
501 Citations
Highly Influential Citations
13
Background Citations
138
Methods Citations
65
Results Citations
1

Figures from this paper

501 Citations

k-core architecture and k-core percolation on complex networks
Nested subgraphs of complex networks
We analytically explore the scaling properties of a general class of nested subgraphs in complex networks, which includes the K-core and the K-scaffold, among others. We name such a class of…
Core organization of directed complex networks
TLDR
This work identifies a set of cores progressively embedded into each other in a network and describes their birth points and structure and finds that generalization of this pruning algorithm to directed networks provides a significantly more complex picture of cores.
Organization of modular networks
TLDR
It is demonstrated that even a relatively small number of shortcuts unite the networks into one if the number of interlinks is any finite fraction of the total number of connections, and the intervertex distance distribution approaches a delta -function peaked form.
Generalization of core percolation on complex networks.
TLDR
A k-leaf removal algorithm as a generalization of the so-called leaf removal algorithm, where vertices of degree smaller than k are progressively removed from a random network and the network is reduced to a subgraph which is called the Generalized k-core (Gk-core).
Heterogeneous k-core versus bootstrap percolation on complex networks.
TLDR
It is shown that the network structure has a crucial effect on these processes, with the giant heterogeneous k-core appearing immediately at a finite value for any f>0 when the degree distribution tends to a power law P(q)~q(-γ) with γ<3.
Natural emergence of a core structure in networks via clique percolation
Networks are often presented as containing a “core” and a “periphery.” The existence of a core suggests that some vertices are central and form the skeleton of the network, to which all other…
Percolation and the Effective Structure of Complex Networks
TLDR
This work introduces an intensive description of network structure that yields almost identical predictions to the ones obtained with MPA for bond percolation, and highlights how accurately capturing the long-range correlations in network structures allows to easily and effectively compress real complex network data.
Generalized k-core percolation on correlated and uncorrelated multiplex networks.
TLDR
The existence of a tipping point of the number of layers, above which the Gk-core collapses abruptly is unraveled, and the assortative mixing for interlayer degrees strengthens the GK-core but still gives rise to discontinuous phase transitions as compared to the uncorrelated counterparts.
The $K$-core structure of complex networks with node reinforcement
Percolation theory provides a quantitative framework to estimate and enhance robustness of complex networked systems. A typical nonstructural method to improve network robustness is to introduce…
...
...

References

SHOWING 1-10 OF 57 REFERENCES
k-core architecture and k-core percolation on complex networks
Nested subgraphs of complex networks
We analytically explore the scaling properties of a general class of nested subgraphs in complex networks, which includes the K-core and the K-scaffold, among others. We name such a class of…
k-core (bootstrap) percolation on complex networks: Critical phenomena and nonlocal effects
TLDR
The theory of the -core (bootstrap) percolation on uncorrelated random networks with arbitrary degree distributions is developed and it is demonstrated that a so-called "corona" of the k-core plays a crucial role.
Clique percolation in random networks.
TLDR
Why clique percolation is a novel and efficient approach to the identification of overlapping communities in large real networks is discussed.
A model of Internet topology using k-shell decomposition
TLDR
This analysis uses information on the connectivity of the network shells to separate, in a unique (no parameters) way, the Internet into three subcomponents: a nucleus that is a small, very well connected globally distributed subgraph; a fractal subcomponent that is able to connect the bulk of the Internet without congesting the nucleus, with self-similar properties and critical exponents predicted from percolation theory.
Evolution of networks
TLDR
The recent rapid progress in the statistical physics of evolving networks is reviewed, and how growing networks self-organize into scale-free structures is discussed, and the role of the mechanism of preferential linking is investigated.
Clustering in complex networks. II. Percolation properties.
  • M. Serrano, M. Boguñá
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2006
TLDR
It is shown that weak clustering hinders the onset of the giant component whereas strong clustering favors its appearance, a direct consequence of the differences in the k -core structure of the networks, which are found to be totally different depending on the level of clustering.
K-core decomposition of Internet graphs: hierarchies, self-similarity and measurement biases
TLDR
It is found 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.
Resilience of the internet to random breakdowns
TLDR
This work shows analytically and numerically that for alpha</=3 the transition never takes place, unless the network is finite, and finds that the physical structure of the Internet is impressively robust, with p(c)>0.99.
Critical phenomena in complex networks
TLDR
A wide range of critical phenomena in equilibrium and growing networks including the birth of the giant connected component, percolation, $k$-core percolations, phenomena near epidemic thresholds, condensation transitions,critical phenomena in spin models placed on networks, synchronization, and self-organized criticality effects in interacting systems on networks are mentioned.
...
...