Self-similarity of complex networks and hidden metric spaces

Abstract

We demonstrate that the self-similarity of some scale-free networks with respect to a simple degree-thresholding renormalization scheme finds a natural interpretation in the assumption that network nodes exist in hidden metric spaces. Clustering, i.e., cycles of length three, plays a crucial role in this framework as a topological reflection of the triangle inequality in the hidden geometry. We prove that a class of hidden variable models with underlying metric spaces are able to accurately reproduce the self-similarity properties that we measured in the real networks. Our findings indicate that hidden geometries underlying these real networks are a plausible explanation for their observed topologies and, in particular, for their self-similarity with respect to the degree-based renormalization.

References in corpus (1)

• The spatial structure of networks

Cited by in corpus (8)

• Navigability of Complex Networks
• Traffic-driven Epidemic Spreading in Finite-size Scale-Free Networks
• Curvature and temperature of complex networks
• Rich-club vs rich-multipolarization phenomena in weighted networks
• Scale-free networks as preasymptotic regimes of superlinear preferential attachment
• Navigating ultrasmall worlds in ultrashort time
• Heterogeneous network with distance dependent connectivity
• Time series of Internet AS-level topology graphs: four patterns and one model