Detecting community structure in networks by
representative energy
Detecting community structure in networks by
representative energy
Ji LIU 1, Guishi DENG 2,
1.Institute of System
Engineering, Dalian University of Technology, Dalian 116023, China；College of Statistics
and Information, Xinjiang University of Finance and Economics, Urumqi
830012, China; 2.Institute of System
Engineering, Dalian University of Technology, Dalian 116023, China;
Abstract：Network community has attractedmuch attention recently, but the accuracy and efficiency in finding a community structure is limited by the lower resolution of modularity. This paper presents a new method of detecting community based on representative energy. The method can divide the communities and find the representative of community simultaneously. The communities of network emerges during competing for the representative among nodes in network, thus we can sketch structure of the whole network. Without the optimizing by modularity, the community of network emerges with competing for representative among those nodes. To obtain the proximate relationships among nodes, we map the nodes into a spectral matrix. Then the top eigenvectors are weighted according to their contributions to find the representative node of a community. Experimental results show that the method is effective in detecting communities of networks.
. Detecting community structure in networks by
representative energy[J]. Front. Comput. Sci., 2009, 3(3): 366-372.
Ji LIU , Guishi DENG , . Detecting community structure in networks by
representative energy. Front. Comput. Sci., 2009, 3(3): 366-372.
Zhang Z Z, Rong L L, Comellas F. Evolving smallworldnetworks with geographical attachment preference. Journal of Physics A: Mathematical and General, 2006, 39(13): 3253―3261 doi: 10.1088/0305-4470/39/13/005
Zhang Z Z, Rong L L, Comellas F. High dimensionalrandom apollonian networks. Physica A, 2006, 364: 610―618 doi: 10.1016/j.physa.2005.09.042
Palla G, Derenyi I, Farkas I, Vicsek T. Uncoveringthe overlapping community structure of complex networks in natureand society. Nature, 2005, 435: 814―818 doi: 10.1038/nature03607
Palla G, Barabasi A L, Vicsek T. Quantifying social group evolution. Nature, 2007, 446: 664―667 doi: 10.1038/nature05670
Newman M E J. Detecting community structure in networks. European Physical Journal B, 2004, 38: 321―330 doi: 10.1140/epjb/e2004-00124-y
Clauset A. Findinglocal community structure in networks. Physical Review E, 2005, 72: 026132 doi: 10.1103/PhysRevE.72.026132
Kernighan B,WLin S. An efficient heuristic procedurefor partitioning graphs. Bell System TechnicalJournal, 1970, 49: 291―307
Pothen A, Simon H, Liou K P. Partitioning sparse matrices with eigenvectors of graphs. SIAM Journal on Matrix Analysis and Applications, 1990, 11(3): 430―452 doi: 10.1137/0611030
Fiedler M. Algebraic connectivity of graphs. SIAMJournal on Matrix Analysis and Applications, 1973, 23: 430―452
Newman ME J, Girvan M. Finding and evaluating communitystructure in networks. Physical ReviewE, 2004, 69: 026113 doi: 10.1103/PhysRevE.69.026113
Newman M E J. Finding community structure in networks using the eigenvectors ofmatrices. Physical Review E, 2006, 74(3): 036104 doi: 10.1103/PhysRevE.74.036104
Capocci A, Servedio V D P, Caldarelli G, et al. Detecting communities in large networks. In: Proceedings of the 3rd Workshop on algorithmsand models for the web graph, number 3243 in Lecture Notes in ComputerScience, Springer, Berlin, 2004
Estrada E, Rodriguez-Velazquez J A. Spectralmeasures of biparitivity in complex networks. Physical Review E, 2005, 72: 046105 doi: 10.1103/PhysRevE.72.046105
White S, Smyth P. A spectral clustering approachto finding communities in graphs. In: Proceedingsof the 5th SIAM International conference on data Mining. Society forindustrial and applied Mathematics, Philadiphia, 2005
Zhang S H ,Wang R S, Zhang X Z, et al. Identification of overlapping community structurein complex networks using fuzzy c-means clustering. Physica A, 2007, 374: 483―490 doi: 10.1016/j.physa.2006.07.023
Kumpula J M, Saramaki J, Kaski K, et al. Limited resolution in complex network communitydetection with Potts model approach. EuropeanPhysical Journal B, 2007, 56: 41―45 doi: 10.1140/epjb/e2007-00088-4
Li Z P, Zhang S H, Wan R S. Quantitative function for community detection. Physical Review E, 2008, 77: 036109 doi: 10.1103/PhysRevE.77.036109
Arenas A, Fernandez A, Gomez S. Multiple resolution of the modular structure of complexnetworks. Arxiv:physics/0703218, 2007
Reichardt J, Bornholdt S. Statistical mechanics ofcommunity detection. Physical Review E, 2006, 74: 016110 doi: 10.1103/PhysRevE.74.016110
Frey B J, Dueck D. Clustering by passing messagebetween data points. Science, 2007, 315: 972―976 doi: 10.1126/science.1136800
Zachary W W. An information flow model for conflict and fission in small groups. Journal of Anthropological Research, 1977, 33: 452―473
