复杂网络子图中心性分析  

Analysis of Subgraph Centrality in Complex Networks

作　　者：李发旭[1,2] 卫良[3] 

机构地区：[1]陕西师范大学计算机学院,陕西西安710062 [2]青海师范大学计算机学院,青海西宁810008 [3]青海师范大学数学系,青海西宁810008

出　　处：《青海师范大学学报（自然科学版）》2013年第4期11-16,共6页Journal of Qinghai Normal University(Natural Science Edition)

基　　金：国家自然科学基金课题(61164005;60863006);国家重点基础研究项目(2010CB334708);长江学者和创新研究团队项目(IRT1068)资助

摘　　要：许多现实网络虽然具有小世界和无标度的全局结构特征,但可能具有非常不同的局部结构特征,子图从局部层次刻画了网络内部相互连接的特定模式.本文通过仿真分析的方法研究了ER随机网络、WS小世界网络和BA无标度网络模型的子图中心性的特点,得出了这三类网络模型的子图中心性与网络密度、重连概率和网络规模之间的关系.仿真结果表明,子图中心性能够刻画复杂网络的拓扑结构.Many real networks have been shown to share global statistical features, such as the ＂small world＂ and the ＂scale-free＂ effects, but they have very different local structural properties. Subgraphs characterize specific patterns of interconnection at the local level. In this paper, characteristics of subgraph centrality are investigated through theory-guided extensive numerical simulations for the ER random network, the WS small-world network and the BA scale-free network, respectively. It was presented that the relationship between the subgraph centrality and density, rewiring probability and the network size for three complex network models. Experimental results show the subgraph centrality can characterizes true topological structure of the complex networks.

关 键 词：复杂网络 子图中心性 拓扑结构 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]