Nested subgraphs of complex networks

DOI10.1088/1751-8113/41/38/385003MaRDI QIDQ3528225zbMATH OpenOpenAlexWikidataFDO

Authors Bernat Corominas-Murtra, J. F. F. Mendes, Ricard Solé

Publication date 8 October 2008

Published in Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0712.0512

Mathematics Subject Classification ID

Applications of graph theory (05C90) Applications of graph theory to circuits and networks (94C15)

Abstract: 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 class of subgraphs $K$-nested subgraphs due to the fact that they generate families of subgraphs such that $\mathrm{...}{S}_{K+1}(calG)subseteq{S}_K(calG)subseteq{S}_{K-1}(calG)\mathrm{...}$. Using the so-called {em configuration model} it is shown that any family of nested subgraphs over a network with diverging second moment and finite first moment has infinite elements (i.e. lacking a percolation threshold). Moreover, for a scale-free network with the above properties, we show that any nested family of subgraphs is self-similar by looking at the degree distribution. Both numerical simulations and real data are analyzed and display good agreement with our theoretical predictions.

Recommendations

• Percolation of arbitrary uncorrelated nested subgraphs
• k-core organization in complex networks
• Optimal subgraph structures in scale-free configuration models
• \(k\)-core architecture and \(k\)-core percolation on complex networks
• Nestedness in networks: A theoretical model and some applications

Cited in

(4)

• Pruning the tree of life: \(k\)-core percolation as selection mechanism
• Optimal subgraph structures in scale-free configuration models
• Nestedness in networks: A theoretical model and some applications
• Percolation of arbitrary uncorrelated nested subgraphs

This page was built for publication: Nested subgraphs of complex networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3528225)