title: Modularity optimization by conformational space annealing.
abstract: We propose a 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 10,000 nodes.
authors.affiliation: School of Computational Sciences, Korea Institute of Advanced Study, Seoul, Korea. juyong@kias.re.kr
authors.forename: Juyong
authors.initials: J
authors.lastname: Lee
authors.forename: Steven P
authors.initials: SP
authors.lastname: Gross
authors.forename: Jooyoung
authors.initials: J
authors.lastname: Lee
mesh_terms: D000465:Algorithms; D000818:Animals; D008962:Models, Theoretical; D013269:Stochastic Processes