Characterizing the analogy between hyperbolic embedding and community structure of complex networks

Abstract

We show that the community structure of a network can be used as a coarse version of its embedding in a hidden space with hyperbolic geometry. The finding emerges from a systematic analysis of several real-world and synthetic networks. We take advantage of the analogy for reinterpreting results originally obtained through network hyperbolic embedding in terms of community structure only. First, we show that the robustness of a multiplex network can be controlled by tuning the correlation between the community structures across different layers. Second, we deploy an efficient greedy protocol for network navigability that makes use of routing tables based on community structure.

4 pages, 3 figures + Supplemental Material

References in corpus (35)

• Fast unfolding of communities in large networks
• Finding and evaluating community structure in networks
• Community detection in graphs
• Maps of random walks on complex networks reveal community structure
• Catastrophic cascade of failures in interdependent networks
• Benchmark graphs for testing community detection algorithms
• Comparing community structure identification
• Stochastic blockmodels and community structure in networks
• The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles
• Hyperbolic Geometry of Complex Networks
• Layer aggregation and reducibility of multilayer interconnected networks
• Popularity versus Similarity in Growing Networks
• Navigability of Complex Networks
• Sustaining the Internet with Hyperbolic Mapping
• MuxViz: A Tool for Multilayer Analysis and Visualization of Networks
• Community detection in networks: Modularity optimization and maximum likelihood are equivalent
• Self-similarity of complex networks and hidden metric spaces
• Percolation in real interdependent networks
• Measuring the evolution of contemporary western popular music
• Identifying modular flows on multilayer networks reveals highly overlapping organization in social systems
• Robust network community detection using balanced propagation
• Local resolution-limit-free Potts model for community detection
• Machine learning meets network science: dimensionality reduction for fast and efficient embedding of networks in the hyperbolic space
• Emergent Hyperbolic Network Geometry
• Network Mapping by Replaying Hyperbolic Growth
• Hidden geometric correlations in real multiplex networks
• Curvature and temperature of complex networks
• Multiscale unfolding of real networks by geometric renormalization
• Optimal percolation on multiplex networks
• Emergence of Soft Communities from Geometric Preferential Attachment
• A nonuniform popularity-similarity optimization (nPSO) model to efficiently generate realistic complex networks with communities
• Network Geometry Inference using Common Neighbors
• Geometric correlations mitigate the extreme vulnerability of multiplex networks against targeted attacks
• Soft communities in similarity space
• Decoding communities in networks

Cited by in corpus (23)

• Network Geometry
• Principled approach to the selection of the embedding dimension of networks
• Link prediction with hyperbolic geometry
• Asymmetry in interdependence makes a multilayer system more robust against cascading failures
• The inherent community structure of hyperbolic networks
• Renormalization group for link percolation on planar hyperbolic manifolds
• Detecting hyperbolic geometry in networks: why triangles are not enough
• Interplay between $k$-core and community structure in complex networks
• Link persistence and conditional distances in multiplex networks
• k-core structure of real multiplex networks
• Growing hyperbolic networks beyond two dimensions: the generalised popularity-similarity optimisation model
• Dynamic Hidden-Variable Network Models
• Epidemic spreading in group-structured populations
• Deep-learning-aided dismantling of interdependent networks
• Zoo Guide to Network Embedding
• Iterative embedding and reweighting of complex networks reveals community structure
• Model-free hidden geometry of complex networks
• Community Detection on Networks with Ricci Flow
• Geometric randomization of real networks with prescribed degree sequence
• Systematic comparison of graph embedding methods in practical tasks
• Symmetry-driven embedding of networks in hyperbolic space
• Hyperbolic Multiplex Network Embedding with Maps of Random Walk
• Hidden multiscale organization and robustness of real multiplex networks