Computer Engineering and Applications ›› 2007, Vol. 43 ›› Issue (23): 64-68.

• 学术探讨 • Previous Articles     Next Articles

Community finding in complex networks by evaluating local community structure

SHEN Xiang-jun   

  1. School of Computer Science and Technology,Soochow University,Suzhou,Jiangsu 215006,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-08-11 Published:2007-08-11
  • Contact: SHEN Xiang-jun

基于子网络结构属性的网络分割研究

沈项军   

  1. 苏州大学 计算机科学与技术学院,江苏 苏州 215006
  • 通讯作者: 沈项军

Abstract: Girvan and Newman have introduced a new divisive algorithm based on“edge betweenness” which has become a standard algorithm in studying the community in the networks.A novel algorithm based on“edge betweenness” is proposed in this paper,which uses the two structure properties of the local community as the way of the graph division.The algorithm shows the character of correct graph division and saving time of computing according to the computer-generated graphs and some real network data.

Key words: complex networks, community finding, structure property of the community

摘要: Girvan和Newman等人提出了一种基于“中间状态边”概念的网络分割算法,成为研究网络结构的代表性算法。根据“中间状态边”概念,提出了一种新颖的网络分割算法:该算法通过分析构成子网络的两个结构属性,给出了一种划分子网络的方法。根据计算机生成的随机网络和一些真实世界网络的子网络划分实验表明,该算法具有划分准确、计算量小的优点。

关键词: 复杂网络, 子网络分割, 子网络结构属性