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 (57)

• Hyperbolic Geometry of Complex Networks
• Navigability of Complex Networks
• Sustaining the Internet with Hyperbolic Mapping
• Traffic-driven Epidemic Spreading in Finite-size Scale-Free Networks
• Curvature and temperature of complex networks
• An Experimental Investigation of Hyperbolic Routing with a Smart Forwarding Plane in NDN
• Rich-club vs rich-multipolarization phenomena in weighted networks
• Percolation in self-similar networks
• Unfolding the multiscale structure of networks with dynamical Ollivier-Ricci curvature
• Detecting the ultra low dimensionality of real networks
• Latent geometry of bipartite networks
• Reconstructing networks
• Universal mean-field framework for SIS epidemics on networks, based on graph partitioning and the isoperimetric inequality
• Scale-free networks as preasymptotic regimes of superlinear preferential attachment
• Navigating ultrasmall worlds in ultrashort time
• The inherent community structure of hyperbolic networks
• Inherent directionality explains the lack of feedback loops in empirical networks
• Clustering Spectrum of scale-free networks
• Emergence of geometric Turing patterns in complex networks
• Scaling theory of fractal complex networks
• Detecting hyperbolic geometry in networks: why triangles are not enough
• Network Alignment
• A geometry-induced topological phase transition in random graphs
• Collective dynamics on higher-order networks
• Model-independent methods for embedding directed networks into Euclidean and hyperbolic spaces
• Growing hyperbolic networks beyond two dimensions: the generalised popularity-similarity optimisation model
• Networks with many structural scales: a Renormalization Group perspective
• Network Renormalization
• Analytical estimation of the correlation dimension of integer lattices
• Maximally modular structure of growing hyperbolic networks
• Spatial search by continuous-time quantum walks on renormalized Internet networks
• Random graphs and real networks with weak geometric coupling
• Multiscale Voter Model on Real Networks
• Effect of clustering on Turing instability in complex networks
• Scaling properties of scale-free networks in degree-thresholding renormalization flows
• The Fitness-Corrected Block Model, or how to create maximum-entropy data-driven spatial social networks
• Emergent information dynamics in many-body interconnected systems
• Strange Attractors in Complex Networks
• Greedy routing optimisation in hyperbolic networks
• Geometric detection of hierarchical backbones in real networks
• Heterogeneous network with distance dependent connectivity
• The multiscale self-similarity of the weighted human brain connectome
• Beyond traditional box-covering: Determining the fractal dimension of complex networks using a fixed number of boxes of flexible diameter
• Dynamics of hot random hyperbolic graphs
• Community Detection in the Hyperbolic Space
• Systematic comparison of graph embedding methods in practical tasks
• When to Boost: How Dose Timing Determines the Epidemic Threshold
• Symmetry-driven embedding of networks in hyperbolic space
• Nearest-neighbour directed random hyperbolic graphs
• Curvature of an Arbitrary Surface for Discrete Gravity and for $d=2$ Pure Simplicial Complexes
• Mapping bipartite networks into multidimensional hyperbolic spaces
• Multiplexity amplifies geometry in networks
• Latent geometry emerging from network-driven processes
• Robustness and size-dependence of circadian rhythms in multiscale suprachiasmatic-nucleus networks
• Modelling the Self-similarity in Complex Networks Based on Coulomb's Law
• Time series of Internet AS-level topology graphs: four patterns and one model
• Hidden multiscale organization and robustness of real multiplex networks