Information-theoretic approach to network modularity

Etay Ziv, Manuel Middendorf, and Chris H. Wiggins
Phys. Rev. E 71, 046117 – Published 14 April 2005

Abstract

Exploiting recent developments in information theory, we propose, illustrate, and validate a principled information-theoretic algorithm for module discovery and the resulting measure of network modularity. This measure is an order parameter (a dimensionless number between 0 and 1). Comparison is made with other approaches to module discovery and to quantifying network modularity (using Monte Carlo generated Erdös-like modular networks). Finally, the network information bottleneck (NIB) algorithm is applied to a number of real world networks, including the “social” network of coauthors at the 2004 APS March Meeting.

  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
1 More
  • Received 14 November 2004

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

©2005 American Physical Society

Authors & Affiliations

Etay Ziv

  • College of Physicians & Surgeons, Department of Biomedical Engineering, Columbia University, New York, New York 10027, USA

Manuel Middendorf

  • Department of Physics, Columbia University, New York, New York 10027, USA

Chris H. Wiggins

  • Department of Applied Physics and Applied Mathematics, Center for Computational Biology and Bioinformatics, Columbia University, New York, New York 10027, USA

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 71, Iss. 4 — April 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
×