Topological estimation of the latent geometry of a complex network

Abstract

Most real-world networks are embedded in latent geometries. If a node in a network is found in the vicinity of another node in the latent geometry, the two nodes have a disproportionately high probability of being connected by a link. The latent geometry of a complex network is a central topic of research in network science, which has an expansive range of practical applications such as efficient navigation, missing link prediction, and brain mapping. Despite the important role of topology in the structures and functions of complex systems, little to no study has been conducted to develop a method to estimate the general unknown latent geometry of complex networks. Topological data analysis, which has attracted extensive attention in the research community owing to its convincing performance, can be directly implemented into complex networks; however, even a small fraction (0.1%) of long-range links can completely erase the topological signature of the latent geometry. Inspired by the fact that long-range links in a network have disproportionately high loads, we develop a set of methods that can analyze the latent geometry of a complex network: the modified persistent homology diagram and the map of the latent geometry. These methods successfully reveal the topological properties of the synthetic and empirical networks used to validate the proposed methods.

References in corpus (26)

• Finding community structure in networks using the eigenvectors of matrices
• Hierarchical structure and the prediction of missing links in networks
• Networks beyond pairwise interactions: structure and dynamics
• Hyperbolic Geometry of Complex Networks
• The physics of higher-order interactions in complex systems
• Sustaining the Internet with Hyperbolic Mapping
• Explosive higher-order Kuramoto dynamics on simplicial complexes
• Persistent homology analysis of protein structure, flexibility and folding
• Social contagion models on hypergraphs
• Persistent Homology of Complex Networks
• Random walks on hypergraphs
• The effect of heterogeneity on hypergraph contagion models
• Abrupt phase transition of epidemic spreading in simplicial complexes
• Multi-body Interactions and Non-Linear Consensus Dynamics on Networked Systems
• Spectral coarse-graining of complex networks
• Scale-free trees: the skeletons of complex networks
• Simplicial SIS model in scale-free uniform hypergraph
• Geographical Coarsegraining of Complex Networks
• Complete trails of co-authorship network evolution
• The spectral dimension of simplicial complexes: a renormalization group theory
• Betweenness centrality of teams in social networks
• Homological Percolation and the Euler Characteristic
• Effective epidemic containment strategy in hypergraphs
• Homological percolation transitions in growing simplicial complexes
• Coalescent embedding in the hyperbolic space unsupervisedly discloses the hidden geometry of the brain
• Unsupervised learning of topological phase diagram using topological data analysis