Centrality scaling in large networks

Abstract

Betweenness centrality lies at the core of both transport and structural vulnerability properties of complex networks, however, it is computationally costly, and its measurement for networks with millions of nodes is near impossible. By introducing a multiscale decomposition of shortest paths, we show that the contributions to betweenness coming from geodesics not longer than L obey a characteristic scaling vs L, which can be used to predict the distribution of the full centralities. The method is also illustrated on a real-world social network of 5.5*10^6 nodes and 2.7*10^7 links.

References in corpus (6)

• Understanding individual human mobility patterns
• Structure and tie strengths in mobile communication networks
• Cascade control and defense in complex networks
• Structure of shells in complex networks
• Congestion-gradient driven transport on complex networks
• Random Walks on Complex Networks

Cited by in corpus (13)

• Predicting commuter flows in spatial networks using a radiation model based on temporal ranges
• A Survey on Centrality Metrics and Their Implications in Network Resilience
• Distributed Algorithms for Computation of Centrality Measures in Complex Networks
• A Self-Organization Framework for Wireless Ad Hoc Networks as Small Worlds
• Cascading failures in spatially-embedded random networks
• Betweenness Centrality in Dense Random Geometric Networks
• Spatio-temporal organization of dynamics in a two-dimensional periodically driven vortex flow: a Lagrangian flow network perspective
• Limits of Predictability of Cascading Overload Failures in Spatially-Embedded Networks with Distributed Flows
• Betweenness centrality in dense spatial networks
• Explosive dismantling of two-dimensional random lattices under betweenness centrality attacks
• DANCE: A Framework for the Distributed Assessment of Network Centralities
• Vulnerability of Transport through Evolving Spatial Networks
• Computational Human Dynamics