Community detection in complex networks

Journal of Computer Science and Technology

Volumn 23, Issue 4, 2008, Pages 672-683

  Du, Nan ^a   Wang, Bai ^a   Wu, Bin ^a  

^a BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS   (China)

Author keywords

Community detection; Complex networks; Social network analysis

Indexed keywords

COMMUNITY DETECTION; COMMUNITY STRUCTURES; COMPLEX NETWORKS; COMPUTATIONAL COSTS; LARGE NETWORKS; NORTH AMERICA; POWER GRIDS; PRIORI KNOWLEDGE; SCIENTIFIC COLLABORATIONS; SOCIAL NETWORK ANALYSIS; SOUTH FLORIDA; URBAN TRAFFIC NETWORK;

COSTS; FINANCE; POWER GENERATION; TELECOMMUNICATION TRAFFIC;

CHLORINE COMPOUNDS;

EID: 49449111889     PISSN: 10009000     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11390-008-9163-6     Document Type: Article

References (32)

1. Watts D J, Strogatz S H. Collective dynamics of "small-world" networks. Nature, 393(6684): 440-442.
2. Watts D J. Small Worlds: The Dynamics of Networks Between Order and Randomness. Levin S A, Strogatz S H (eds.), Princeton: Princeton University Press, 1999.
3. Boccaletti S, Latora V, Moreno Y. Complex networks: Structure and dynamics. Physics Reports, 424(4/5): 175-308.
4. Newman M E J. The structure and function of complex networks. SIAM Review, 45(2): 167-256.
5. Wasserman S, Faust K. Social Network Analysis. Cambridge: Cambridge University Press, 1994.
6. Scott J. Social Network Analysis: A Handbook. London: Sage Publications, 2002.
7. Milo R, Itzkovitz S et al. Network motifs: Simple building blocks of complex networks. Science, 298(5594): 824-827.
8. Newman M E J. Modularity and community structure in networks. PNAS, 103(23): 8577.
9. Girvan M, Newman M E J. Community structure in social and biological networks. PNAS, 99(12): 7821-7826.
10. Duch J, Arenas A. Community detection in complex networks using extremal optimization. Physical Review E, 72(2): 027104.
11. Palla G, Dernyi I, Farkas I. Uncovering the overlapping community structure of complex network in nature and society. Nature, 435(7043): 814-818.
12. Fiedler M. Algebraic connectivity of graphs. Czechoslovak Mathematical Journal, 23(98): 298-305.
13. Pothen A, Simon H, Liou K-P. Partitioning sparse matrices with eigenvectors of graphs. SIAM J Matrix Anal App., 11(33): 430-452.
14. Kernighan B W, Lin S. A efficient heuristic procedure for partitioning graphs. Bell System Technical Journal, 49(2): 291-307.
15. Newman M E J. Detecting community structure in networks. Eur. Phys. J. B, 38(2): 321-330.
16. Bron C, Kerbosch J. Finding all cliques of an undirected graph. Communications of the ACM, 16(9): 575-577.
17. Du N, Wu B, Wang B et al. A parallel algorithm for enumerating all maximal cliques in complex networks. In Proc. The 6th ICDM2006 Workshop, Hong Kong, 2006, pp.320-324.
18. Wu B, Pei X et al. A parallel algorithm for enumerating all the maximal k-plexes. In Proc. PAKDD07 Workshops, Nanjing, 2007, pp.476-483.
19. Abello J, Resende M G C, Sudarsky S et al. Massive quasiclique detection. In Proc. the 5th Latin American Symposium on Theoretical Informatics, Mexico, 2002, pp.598-612.
20. Pei J, Jiang D X, Zhang A D et al. On mining cross-graph quasi-cliques. In Proc. The 12th ACM SIGKDD, Philadelphia, 2006, pp.228-237.
21. Zeng Z, Wang J, Karypis G et al. Coherent closed quasiclique discovery from large dense graph databases. In Proc. The 12th ACM SIGKDD, Philadelphia, 2006, pp.797-802.
22. Han J W, Kamber M. Data Mining: Concepts and Techniques. 2nd Edition, Morgan Kaufmann Publishers, 2006.
23. Luca Donetti, Miguel A. Munoz detecting network communities: A new systematic and efficient algorithm. Electric Journal of Statistical Mechanics, doi 10.1088/1742-5468/2004/10/P10012, http://www.iop.org/EJ/abstract/1742-5468/ 2004/10/P10012.
24. Girvan M, Newman M E J. Finding and evaluating community structure in networks. Physical Review E, 69(2): 026113.
25. Radicchi F, Castellano C, Cecconi F, Loreto V, Parisi D. Defining and identifying communities in networks. PNAS, 101(9): 2658-2663.
26. Clauset A, Newman M E J, Moore C. Finding community structure in very large networks. Physical Review E, 70(6): 066111.
27. Pons P, Latapy M. Computing communities in large networks using random walks. In Proc. ISCIS2005, Istanbul, 2005, pp.284-293.
28. Clauset A. Finding local community structure in networks. Physical Review E, 72(2): 026132.
29. Yang B, Liu D Y. Force-based incremental algorithm for mining community structure in dynamic network. Journal of Computer Science and Technology, 21(3): 393-400.
30. Gunes I, Bingol H. Community detection in complex networks using agents. Cornell University Library e-prints, arXiv:cs/0610129v1, http://arxiv.org/abs/ cs/0610129v1.
31. Fortunato S, Barthelemy M. Resolution limit in community detection. PNAS, 2007, 104(1): 36-41.
32. http://w3.usf.edu/FreeAssociation/.