title: 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 nearly 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 versus 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.
authors.affiliation: Interdisciplinary Center for Network Science and Applications (iCeNSA), Department of Physics, University of Notre Dame,Notre Dame, Indiana, 46556 USA. mercseyr@nd.edu
authors.forename: Mária
authors.initials: M
authors.lastname: Ercsey-Ravasz
authors.forename: Zoltán
authors.initials: Z
authors.lastname: Toroczkai