社会合作网络中社团结构的搜索算法研究

An Searching Algorithm for Analyzing Community Structure in Complex Networks

许多实际的网络都具有一个共同性质,即它们都是由各个社团通过公共节点连接而成网络,因此,网络中社团的数目以及每个节点归属于社团的数目对于研究复杂网络都具有重要的意义。通过分析复杂网络的社团结构和寻找网络社团数目的传统算法,针对传统算法所存在的缺陷,提出了一种搜索社团结构的算法。该算法正确的对网络的社团结构进行了划分,且较好的改进了其运行效率。最后指出了进一步的研究方向。

Many actual networks all have a common character, namely they are all composed by each consortium through the public node connection, therefor, the number of the consortium and the node which belongs to the consortium are more meaningful to study the complex network. This article analyzes the structure of consortium of complex network and the tradition arithmetic of searching the number of the network consortium, in allusion to the objection of the traditional arithmetic, we also bring up a arithmetic which is searching for consortium construction on the basic of the grade clustering arithmetic. This arithmetic plots the consortium construction of the network correctly, and also improve its function efficiency well. Finally, some future directions are pointed.