Greedy routing optimisation in hyperbolic networks

Abstract

Finding the optimal embedding of networks into low-dimensional hyperbolic spaces is a challenge that received considerable interest in recent years, with several different approaches proposed in the literature. In general, these methods take advantage of the exponentially growing volume of the hyperbolic space as a function of the radius from the origin, allowing a (roughly) uniform spatial distribution of the nodes even for scale-free small-world networks, where the connection probability between pairs decays with hyperbolic distance. One of the motivations behind hyperbolic embedding is that optimal placement of the nodes in a hyperbolic space is widely thought to enable efficient navigation on top of the network. According to that, one of the measures that can be used to quantify the quality of different embeddings is given by the fraction of successful greedy paths following a simple navigation protocol based on the hyperbolic coordinates. In the present work, we develop an optimisation scheme for this score in the native disk representation of the hyperbolic space. This optimisation algorithm can be either used as an embedding method alone, or it can be applied to improve this score for embeddings obtained from other methods. According to our tests on synthetic and real networks, the proposed optimisation can considerably enhance the success rate of greedy paths in several cases, improving the given embedding from the point of view of navigability.

References in corpus (25)

• Statistical mechanics of complex networks
• Community detection in graphs
• The large-scale organization of metabolic networks
• Hierarchical structure and the prediction of missing links in networks
• Community detection in networks: A user guide
• Hyperbolic Geometry of Complex Networks
• Popularity versus Similarity in Growing Networks
• Navigability of Complex Networks
• Sustaining the Internet with Hyperbolic Mapping
• Self-similarity of complex networks and hidden metric spaces
• Network Geometry
• Machine learning meets network science: dimensionality reduction for fast and efficient embedding of networks in the hyperbolic space
• On community structure in complex networks: challenges and opportunities
• Network Mapping by Replaying Hyperbolic Growth
• Hidden geometric correlations in real multiplex networks
• Network Cosmology
• Emergence of Soft Communities from Geometric Preferential Attachment
• A nonuniform popularity-similarity optimization (nPSO) model to efficiently generate realistic complex networks with communities
• Link prediction with hyperbolic geometry
• The inherent community structure of hyperbolic networks
• Model-independent methods for embedding directed networks into Euclidean and hyperbolic spaces
• Random hyperbolic graphs in $d+1$ dimensions
• Growing hyperbolic networks beyond two dimensions: the generalised popularity-similarity optimisation model
• Optimisation of the coalescent hyperbolic embedding of complex networks
• Maximally modular structure of growing hyperbolic networks

Cited by in corpus (1)

• Curvature of an Arbitrary Surface for Discrete Gravity and for $d=2$ Pure Simplicial Complexes