Community Detection in Complex Networks using Genetic Algorithm
Mursel Tasgin, Haluk Bingol
Abstract
Community structure identification has been an important research topic in complex networks and there has been many algorithms proposed so far to detect community structures in complex networks, where most of the algorithms are not suitable for very large networks because of their time-complexity. Genetic algorithm for detecting communities in complex networks, which is based on optimizing network modularity using genetic algorithm, is presented here. It is scalable to very large networks and does not need any priori knowledge about number of communities or any threshold value. It has O(e) time-complexity where e is the number of edges in the network. Its accuracy is tested with the known Zachary Karate Club and College Football datasets. Enron e-mail dataset is used for scalability test.
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