Community detection in complex networks using extremal optimization

Jordi Duch and Alex Arenas
Phys. Rev. E 72, 027104 – Published 24 August 2005

Abstract

We propose a method to find the community structure in complex networks based on an extremal optimization of the value of modularity. The method outperforms the optimal modularity found by the existing algorithms in the literature giving a better understanding of the community structure. We present the results of the algorithm for computer-simulated and real networks and compare them with other approaches. The efficiency and accuracy of the method make it feasible to be used for the accurate identification of community structure in large complex networks.

  • Figure
  • Figure
  • Figure
  • Figure
  • Received 17 January 2005

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

©2005 American Physical Society

Authors & Affiliations

Jordi Duch and Alex Arenas

  • Departament d’Enginyeria Informàtica i Matemàtiques, Universitat Rovira i Virgili, 43007 Tarragona, Spain

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 72, Iss. 2 — August 2005

Reuse & Permissions
Access Options

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
×