基于m阶邻居节点的复杂网络关键节点评估  

Critical network node evaluation based on m-order neighbor nodes

作　　者：王锋[1] 许梁煌 郑玉芳[1] WANG Feng;XU Lianghuang;ZHENG Yufang(College of Civil Engineering,Fuzhou University,Fuzhou,Fujian 350108,China)

机构地区：[1]福州大学土木工程学院,福建福州350108

出　　处：《福州大学学报（自然科学版）》2019年第2期237-243,共7页Journal of Fuzhou University(Natural Science Edition)

基　　金：国家自然科学基金资助项目(51308126)

摘　　要：基于无向无权复杂网络理论,提出一种基于m阶邻居节点重要度贡献的节点重要度评估方法.在综合考虑了节点自身的属性,节点在网络中的位置以及m阶邻居节点的度重要度贡献和介数重要度贡献后,提出m阶邻居节点重要度贡献系数矩阵概念,建立评估模型.通过实验并和其他算法结果进行对比分析,表明所提出的评估方法具有可行性和更高的精确性.当m的取值接近网络的平均路径长度时,节点的重要度评估趋于稳定,可有效提高评估效率.Based on the theory of undirected and unweighted complex networks, a node importance evaluation method based on importance contribution of m -order neighbor nodes is proposed. After considering the properties of the node itself, the position of the node in the network and the contribution of the degree and betweenness from m -order neighbor nodes, the concept of the important degree contribution coefficient matrix of m -order neighbor nodes is put forward and the evaluation model is established . It is concluded that the proposed method is feasible and more accurate through experimental analysis and comparison with other algorithms. When the value of m is close to the average path length of the network, the evaluation results of the degree of importance of the nodes tends to be stable , which can effectively improve the evaluation efficiency.

关 键 词：复杂网络 关键节点 m阶邻居矩阵 贡献矩阵 评估效率 

分 类 号：U491[交通运输工程—交通运输规划与管理]