Community detection in social networks using hybrid merging of sub-communities

Blondel VD, Guillaume JL, Lambiotte R, Lefebvre E. Fast unfolding of communities in large networks. Journal of Statistical Mechanics 2008:P10008. Clauset, 2004, Finding community structure in very large networks, Physical Review E, 70, 066111, 10.1103/PhysRevE.70.066111 Danon L, Duch J, Diaz-Guilera A, Arenas A. Comparing community structure identification. Journal of Statistical Mechanics 2005:P09008. Donetti L, Munoz MA. Detecting network communities: a new systematic and efficient algorithm. Journal of Statistical Mechanics 2004:P10012. Duch, 2005, Community identification using extremal optimization, Physical Review E, 72, 027104, 10.1103/PhysRevE.72.027104 Fortunato, 2007, Resolution limit in community detection, Proceedings of the National Academy of Sciences USA, 104, 36, 10.1073/pnas.0605965104 Fortunato, 2010, Community detection in graphs, Physics Reports, 486, 75, 10.1016/j.physrep.2009.11.002 Girvan, 2002, Community structure in social and biological networks, Proceedings of the National Academy of Sciences USA, 99, 7821, 10.1073/pnas.122653799 Good, 2010, The performance of modularity maximization in practical contexts, Physical Review E, 81, 046106, 10.1103/PhysRevE.81.046106 Granell, 2011, Mesoscopic analysis of networks, Chaos, 21, 016102, 10.1063/1.3560932 Gregory, 2010, Finding overlapping communities in networks by label propagation, New Journal of Physics, 12, 103018, 10.1088/1367-2630/12/10/103018 〈http://www.cc.gatech.edu/dimacs10/archive/clustering.shtml〉. Lancichinetti, 2011, Limits of modularity maximization in community detection, Physical Review E, 84, 066122, 10.1103/PhysRevE.84.066122 Lancichinetti, 2008, Benchmark graphs for testing community detection algorithms, Physical Review E, 78, 046110, 10.1103/PhysRevE.78.046110 Liu Z, Li P, Zheng Y, Sun M. Community detection by affinity propagation. Technical Reports 001, 200, Department of Computer Science and Technology, Tsinghua University, Beijing, China; 2008. Molloy, 1995, A critical point for random graphs with a given degree sequence, Random Structures and Algorithms, 6, 161, 10.1002/rsa.3240060204 Newman, 2006, Modularity and community structure in networks, Proceedings of the National Academy of Sciences USA, 103, 8577, 10.1073/pnas.0601602103 Newman, 2004, Finding and evaluating community structure in networks, Physical Review E, 69, 026113, 10.1103/PhysRevE.69.026113 Newman, 2007, Mixture models and exploratory analysis in networks, Proceedings of the National Academy of Sciences USA, 104, 9564, 10.1073/pnas.0610537104 Omran G, Labaut V, Cherifi H. Comparative evaluation of community detection algorithms: a topological approach, J. Stat. Mech.; 2012. p.p08001. Palla, 2005, Uncovering the overlapping community structure of complex networks in nature and society, Nature, 435, 814, 10.1038/nature03607 Radicchi, 2004, Self-contained algorithms to detect communities in networks, Proceedings of the National Academy of Sciences USA, 101, 2658, 10.1073/pnas.0400054101 Rosvall, 2008, Maps of random walks on complex networks reveal community structure, Proceedings of the National Academy of Sciences USA, 105, 1118, 10.1073/pnas.0706851105 Rosvall, 2007, Maps of random walks on complex networks reveal community structure, Proceedings of the National Academy of Sciences USA, 104, 7327, 10.1073/pnas.0611034104 van Dongen S. (Ph.D. thesis). Dutch National Research Institute for Mathematics and Computer Science. Netherlands: University of Utrecht; 2000. Yan B, Gregory S. Detecting community structure in networks using edge prediction methods. J. Stat. Mech. Theory Exp.; 2012. p.P09008. 〈http://iopscience.iop.org/1742-5468/2012/09/P09008〉