Detecting the ultra low dimensionality of real networks

Abstract

Reducing dimension redundancy to find simplifying patterns in high-dimensional datasets and complex networks has become a major endeavor in many scientific fields. However, detecting the dimensionality of their latent space is challenging but necessary to generate efficient embeddings to be used in a multitude of downstream tasks. Here, we propose a method to infer the dimensionality of networks without the need for any a priori spatial embedding. Due to the ability of hyperbolic geometry to capture the complex connectivity of real networks, we detect ultra low dimensionality far below values reported using other approaches. We applied our method to real networks from different domains and found unexpected regularities, including: tissue-specific biomolecular networks being extremely low dimensional; brain connectomes being close to the three dimensions of their anatomical embedding; and social networks and the Internet requiring slightly higher dimensionality. Beyond paving the way towards an ultra efficient dimensional reduction, our findings help address fundamental issues that hinge on dimensionality, such as universality in critical behavior.

References in corpus (30)

• Graph Embedding Techniques, Applications, and Performance: A Survey
• Self-similarity of complex networks
• Hyperbolic Geometry of Complex Networks
• Origins of fractality in the growth of complex networks
• Random Geometric Graphs
• Sustaining the Internet with Hyperbolic Mapping
• Clique topology reveals intrinsic geometric structure in neural correlations
• How to calculate the fractal dimension of a complex network: the box covering algorithm
• Self-similarity of complex networks and hidden metric spaces
• Persistent Homology of Complex Networks
• Network Geometry
• Machine learning meets network science: dimensionality reduction for fast and efficient embedding of networks in the hyperbolic space
• Clustering in complex networks. I. General formalism
• Curvature and temperature of complex networks
• Blessing of dimensionality: mathematical foundations of the statistical physics of data
• Multiscale unfolding of real networks by geometric renormalization
• Correlation dimension of complex networks
• Geometric renormalization unravels self-similarity of the multiscale human connectome
• A box-covering algorithm for fractal scaling in scale-free networks
• Wiring cost in the organization of a biological network
• Navigable maps of structural brain networks across species
• Principled approach to the selection of the embedding dimension of networks
• A new information dimension of complex networks
• Percolation in self-similar networks
• Small worlds and clustering in spatial networks
• Soft communities in similarity space
• Dimensionality of social networks using motifs and eigenvalues
• Effective dimensions and percolation in hierarchically structured scale-free networks
• Random hyperbolic graphs in $d+1$ dimensions
• Model-free hidden geometry of complex networks

Cited by in corpus (10)

• The low-rank hypothesis of complex systems
• Emergence of geometric Turing patterns in complex networks
• Random hyperbolic graphs in $d+1$ dimensions
• Fundamental interactions in self-organized critical dynamics on higher-order networks
• Exact and rapid linear clustering of networks with dynamic programming
• Scaling properties of scale-free networks in degree-thresholding renormalization flows
• Strange Attractors in Complex Networks
• Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs
• Real-World Networks are Low-Dimensional: Theoretical and Practical Assessment
• Mapping bipartite networks into multidimensional hyperbolic spaces