Core-periphery organization of complex networks

Petter Holme
Phys. Rev. E 72, 046111 – Published 12 October 2005

Abstract

Networks may, or may not, be wired to have a core that is both itself densely connected and central in terms of graph distance. In this study we propose a coefficient to measure if the network has such a clear-cut core-periphery dichotomy. We measure this coefficient for a number of real-world and model networks and find that different classes of networks have their characteristic values. Among other things we conclude that geographically embedded transportation networks have a strong core-periphery structure. We proceed to study radial statistics of the core, i.e., properties of the n neighborhoods of the core vertices for increasing n. We find that almost all networks have unexpectedly many edges within n neighborhoods at a certain distance from the core suggesting an effective radius for nontrivial network processes.

  • Figure
  • Figure
  • Received 3 June 2005

DOI:https://doi.org/10.1103/PhysRevE.72.046111

©2005 American Physical Society

Authors & Affiliations

Petter Holme

  • Department of Physics, University of Michigan, Ann Arbor, Michigan 48109, USA

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 72, Iss. 4 — October 2005

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review E

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×