Mod-CSA: Modularity optimization by conformational space annealing
Computational Physics
2012-04-26 v2 Social and Information Networks
Data Analysis, Statistics and Probability
Physics and Society
Abstract
We propose a new modularity optimization method, Mod-CSA, based on stochastic global optimization algorithm, conformational space annealing (CSA). Our method outperforms simulated annealing in terms of both efficiency and accuracy, finding higher modularity partitions with less computational resources required. The high modularity values found by our method are higher than, or equal to, the largest values previously reported. In addition, the method can be combined with other heuristic methods, and implemented in parallel fashion, allowing it to be applicable to large graphs with more than 10000 nodes.
Cite
@article{arxiv.1202.5398,
title = {Mod-CSA: Modularity optimization by conformational space annealing},
author = {Juyong Lee and Steven P. Gross and Jooyoung Lee},
journal= {arXiv preprint arXiv:1202.5398},
year = {2012}
}