Centrality Scaling in Large Networks

Mária Ercsey-Ravasz and Zoltán Toroczkai
Phys. Rev. Lett. 105, 038701 – Published 16 July 2010

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×106 nodes and 2.7×107 links.

  • Figure
  • Figure
  • Figure
  • Figure
  • Received 2 March 2010

DOI:https://doi.org/10.1103/PhysRevLett.105.038701

©2010 American Physical Society

Authors & Affiliations

Mária Ercsey-Ravasz* and Zoltán Toroczkai

  • Interdisciplinary Center for Network Science and Applications (iCeNSA), Department of Physics, University of Notre Dame, Notre Dame, Indiana, 46556 USA

  • *mercseyr@nd.edu
  • toro@nd.edu

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 105, Iss. 3 — 16 July 2010

Reuse & Permissions
Access Options
Collection
Heating up of Superconductors
January 27, 2017

This collection marks the 30th anniversary of the discovery of high-temperature superconductors. The papers selected highlight some of the advances that have been made to date, both in understanding why these compounds behave in the way they do, and in utilizing them in applications. The papers included in the collection have been made free to read.

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review Letters

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×