摘要:针对无标度网络的节点重要度评估问题，通过分析节点的邻居数量与其邻居间的拓扑结构，得到节点的结构洞重要性指标，再融合相邻节点的K核重要性指标值来确定相邻节点间的重要度贡献，以此表征相邻节点的局部信息；在此基础上，再结合表征节点位置信息的节点自身的K核重要性，从而提出一种基于节点间重要度贡献关系来评估无标度网络的节点重要度的方法.该方法综合考虑了节点的结构洞特征和K核中心性特征来确定节点的重要度，同时兼顾到了网络的局部和全局重要性.理论分析表明，此方法的时间复杂度仅为o（n²）.与其他几种算法仿真对比的结果表明，该方法可行有效，拥有理想计算能力，适用无标度网络.



Abstract:In order to evaluate the importance of nodes in scale-free networks, by analyzing the number of neighboring nodes and the topology of its neighbors, the index of the structural holes importance of the node is obtained. At the same time, by combining the K core importance index of adjacent nodes, the importance contribution between adjacent nodes is obtained. It characterizes the local information of adjacent nodes. On this basis, combining with the K core importance of the node itself that characterizes the global location information of the node, this study proposes a method to evaluate the importance of nodes in scale-free networks based on the relationship of the importance contribution between nodes. This method takes into account the structural holes characteristics of nodes and the K core central feature to determine the importance contribution between adjacent nodes, and takes into account the local and global importance of the networks. The theoretical analysis shows that the time complexity of this method is only o(n²). Compared with other algorithms, the results show that the method is feasible and effective. It has an ideal computing capability, and is suitable for scale-free networks.



PDF全文下载地址:

http://jos.org.cn/jos/article/pdf/5422