Community detection in complex networks using Extremal Optimization
J. Duch, A. Arenas
Abstract
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.
Create a lesson
Related papers
Optical Ceiling on Polaron Mobility in Disordered Molecular Semiconductors: Lessons from Eumelanin
Alvan Hunt
Glauber dynamics of the Sherrington--Kirkpatrick spin-glass model: a dynamical cavity method
Grzegorz Szamel
Generative diffusion in long-range correlated landscapes: Speciation cascade and the foam structure of the score
Jerome Garnier-Brun, Giulio Biroli, Marc Mézard et al.
A Clifford-index approach connecting boundary Dirac fermions to sigma-model topological terms in the periodic table of topological insulators and superconductors
Y. X. Zhao
Exact solution of the dynamic pseudogap model: Fock-space formalism for Gaussian fluctuations
Michael V. Sadovskii
Covariance-dependent participation scaling of Comtet disorder on open hyperbolic lattices
Wei Li, Yong Cheng