arXiv Analytics

Sign in

arXiv:cond-mat/0501368AbstractReferencesReviewsResources

Community detection in complex networks using Extremal Optimization

J. Duch, A. Arenas

Published 2005-01-16Version 1

We propose a novel 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. 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.

Comments: 4 pages, 4 figures
Journal: Physical Review E, vol. 72, 027104, (2005)
Related articles: Most relevant | Search more
arXiv:cond-mat/0603718 (Published 2006-03-27)
Statistical Mechanics of Community Detection
arXiv:cond-mat/0309436 (Published 2003-09-18, updated 2004-05-13)
Betweenness Centrality in Large Complex Networks
arXiv:1409.2290 [cond-mat.dis-nn] (Published 2014-09-08)
Computational Complexity, Phase Transitions, and Message-Passing for Community Detection