基于复杂网络社区划分的网络拓扑结构可视化布局算法

摘要

许多真实的网络都可以用复杂网络的思想进行研究和解释,而社区结构是复杂网络的一个重要特征.为此,提出一种基于社区结构的网络布局算法.首先利用复杂网络社区发现算法对网络中的节点进行社区划分,并将一个社区抽象为一个节点,以社区间的关联为边构建新的网络；在此基础上,运用物理类比方法确定社区中心点的位置,并根据社区的规模确定社区的区域范围；最后运用条件择优的方式填充社区内部节点以完成网络拓扑的布局.仿真实验结果证明,该算法与传统的可视化布局算法相比,具有计算量更少、收敛速度快、结构清晰的特点,更具有实际应用的价值.%Many.real world networks can be studied and interpreted through the theory of complex network, and one important characteristic of it is a community structure. Based on the community structure of the network, a new network topology layout algorithm is proposed. The network is divided into several communities by community detecting algorithms. Furthermore, the new community network is constructed by nodes and edges abstracted from the communities and the correlations among communities respectively. Based on above, it performs physical analogy topology algorithm to determine the center position of each community and the area scope in terms of its scale. Finally it uses the conditional optimized method to fill up each community intern nodes in order to complete the layout of network topology. The simulation result shows that the proposed algorithm is more efficient, and it provides a better convergence rate, a more clear structure, and a more practical application value.