Fast algorithm for searching adjacent communities and its application in hierarchical community discovery

Journal of Information Hiding and Multimedia Signal Processing

Volumn 1, Issue 3, 2010, Pages 261-268

  Zhou, Xiaohong ^a   Nie, Zhe ^a   Li, Yueping ^a  

^a SHENZHEN POLYTECHNIC   (China)

Author keywords

Adjacent list; Algorithm; Community discovery; Network

Indexed keywords

ADJACENT LISTS; ADJACENT RELATION; COMMUNITY DISCOVERIES; FAST ALGORITHMS; HIERARCHICAL COMMUNITIES; ITS APPLICATIONS; RAPID SEARCH; VERTEX SIMILARITIES;

ELECTRICAL ENGINEERING; NETWORKS (CIRCUITS); SIGNAL PROCESSING;

ALGORITHMS;

EID: 84863039097     PISSN: 20734212     EISSN: 20734239     Source Type: Journal    
DOI: None     Document Type: Article

References (16)

1. S. H. Strogatz, Exploring complex networks, Nature, vol. 410, pp. 268-276, 2001.
2. A. Clauset, C. Moore, and M. E. J. Newman, Hierarchical structure and the prediction of missing links in networks, Nature, vol. 453, pp. 98-101, 2008.
3. D. Price, Networks of scientific papers, in the growth of knowledge: readings on organization and retrieval of information, M. Kochen(eds.), New York: Wiley, pp. 145-155, 1965.
4. J. A. Dunne, R. J. Williams, and N. D. Martinez, Foodweb structure and network theory: The role of connectance and size, Proc. of Natl. Acad. Sci. USA, vol. 99, pp. 12917-12922, 2002.
5. T. Ito, T. Chiba, R. Ozawa, M. Yoshida, M. Hattori, and Y. Sakaki, A comprehensive two-hybrid analysis to explore the yeast protein interactome, Proc. of Natl. Acad. Sci. USA, vol. 98, pp. 4569-4574, 2001.
6. S. Fortunato, Community detection in graphs, arXiv:0906.0612, 2009.
7. B. W. Kernighan and S. Lin, An efficient heuristic procedure for partitioning graphs, Bell System Technical Journal, vol. 49, pp. 291-308, 1970.
8. A. Pothen, H. Simon, and K. P. Liou, Partitioning sparse matrices with eigenvectors of graphs, SIAM J. Matrix Anal. Appl., vol. 11, pp. 430-452, 1990.
9. J. Scott, Social Network Analysis: A Handbook, Sage, London, 2nd edition, 2000.
10. P. Pons and M. Latapy, Computing Communities in Large Networks Using Random Walks, Journal of Graph Algorithms and Applications, vol. 10, no. 2, pp. 191-218, 2006.
11. A. Arenas, A. Diaz-Guilera, and C. J. Peerez-Vicente, Synchronization reveals topological scalses in complex networks, Phys. Rev. Lett., vol. 96, 2006.
12. G. Gan, C. Ma, and J. Wu, Data Clustering: Theory, Algorithms, and Applications, Society for Industrial and Applied Mathematics, Philadelphia, 2007.
13. A. Clauset, M. E. J. Newman, and C. Moore, Finding community structure in very large networks, Phys. Rev. E 70, 066111 (2004)
14. E. Ravasz, A. L. Somera, D. A. Mongru, Z. N. Oltvai, and A. L. Barabsi, Hierarchical organization of modularity in metabolic networks, Science, vol. 297, pp. 1551-1555, 2002
15. D. Lusseau, K. Schneider, O. J. Boisseau, P. Haase, E. Slooten, and S. M. Dawson, The bottlenose dolphin commu-nity of doubful sound features a large problem of long-lasting associations, Behav. Ecol. Sociobiol., vol. 54 pp. 396-405, 2003.
16. M. Girvan and M. E. J. Newman, Community structure in social and biological networks, Proc. of Natl. Acad. Sci. USA, vol. 99, pp. 7821-7826, 2002.