一种复杂网络中社团划分的新算法

A New Algorithm for Partitioning Complex Network into Communities

为了寻找复杂网络中的社团结构,本文基于社团的核的定义和一些定量条件,提出一种新的寻找复杂网络中社团结构的算法。该算法的基本思想是首先构建社团的核心,然后寻找它的邻居的集合,把满足定量条件的邻居节点添加到该核心中,直到没有节点满足定量条件。重复这个过程找出网络中其它所有的社团。最后,通过Zachary和Dolphin social network两个经典网络验证了该算法的有效性。

To find community structures in complex networks,we propose a new algorithm based on the definition of community core and some quantitative conditions,through which a community core is constructed to find its neighbors,satisfying the quantitative conditions so that its neighbors can be tied to it until finally no nodes can be added.All communities in the network are obtained by repeating this process.Finally,the algorithm is applied to the classic Zachary network and Dolphin social network to verify its validity.