Parameterized centrality metric for network analysis

Rumi Ghosh and Kristina Lerman
Phys. Rev. E 83, 066118 – Published 29 June 2011

Abstract

A variety of metrics have been proposed to measure the relative importance of nodes in a network. One of these, alpha-centrality [P. Bonacich, Am. J. Sociol. 92, 1170 (1987)], measures the number of attenuated paths that exist between nodes. We introduce a normalized version of this metric and use it to study network structure, for example, to rank nodes and find community structure of the network. Specifically, we extend the modularity-maximization method for community detection to use this metric as the measure of node connectivity. Normalized alpha-centrality is a powerful tool for network analysis, since it contains a tunable parameter that sets the length scale of interactions. Studying how rankings and discovered communities change when this parameter is varied allows us to identify locally and globally important nodes and structures. We apply the proposed metric to several benchmark networks and show that it leads to better insights into network structure than alternative metrics.

  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Received 18 October 2010

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

©2011 American Physical Society

Authors & Affiliations

Rumi Ghosh* and Kristina Lerman

  • USC Information Sciences Institute, 4676 Admiralty Way, Marina del Rey, California 90292, USA

  • *rumig@usc.edu
  • lerman@isi.edu

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 83, Iss. 6 — June 2011

Reuse & Permissions
Access Options
CHORUS

Article Available via CHORUS

Download Accepted Manuscript
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
×