Hidden multiscale organization and robustness of real multiplex networks

Abstract

Hidden geometry enables the investigation of complex networks at different scales. Extending this framework to multiplex networks, we uncover a novel kind of mesoscopic organization in real multiplex systems, named $\text{clan}$, a group of nodes that preserve their local geometric arrangement across layers. Furthermore, we reveal the intimate relationship between the unfolding of clan structure and mutual percolation against targeted attacks, leading to an ambivalent role of clans: making a system fragile yet less prone to complete shattering. Finally, we confirm the correlation between the multiscale nature of geometric organization and the overall robustness. Our findings expand the significance of hidden geometry in network function, while also highlighting potential pitfalls in evaluating and controlling catastrophic failure of multiplex systems.

References in corpus (25)

• Catastrophic cascade of failures in interdependent networks
• Estimating Mutual Information
• The structure and dynamics of multilayer networks
• Hyperbolic Geometry of Complex Networks
• Robustness of a Network of Networks
• Popularity versus Similarity in Growing Networks
• Avalanche Collapse of Interdependent Network
• Self-similarity of complex networks and hidden metric spaces
• Avoiding catastrophic failure in correlated networks of networks
• Network robustness of multiplex networks with interlayer degree correlations
• Percolation Theory on Interdependent Networks Based on Epidemic Spreading
• Percolation in Multiplex Networks with Overlap
• Network Geometry
• Network Mapping by Replaying Hyperbolic Growth
• Hidden geometric correlations in real multiplex networks
• Multiscale unfolding of real networks by geometric renormalization
• Emergence of Soft Communities from Geometric Preferential Attachment
• Geometric renormalization unravels self-similarity of the multiscale human connectome
• Network Geometry Inference using Common Neighbors
• Correlated Edge Overlaps in Multiplex Networks
• Weak percolation on multiplex networks
• Geometric correlations mitigate the extreme vulnerability of multiplex networks against targeted attacks
• Characterizing the analogy between hyperbolic embedding and community structure of complex networks
• Emergence of geometric Turing patterns in complex networks
• Multiscale Voter Model on Real Networks