Abstract: The importance of complex network nodes ordering is an important part of complex network research.Based on the k- core algorithm,weighted value is introduced to redefine the value of node k for weighted network.In order to quantify the influence of weight on the importance of network nodes,a new improved k-core algorithm for weighted network is proposed and the influence of the change of the balance coefficients value on the algorithm is analyzed.Simulation results show that the proposed algorithm is superior to k-core,and has the characteristics of adjusting the balance coefficient to adapt to different weighted networks,it is suitable for the importance evaluation of weighted network nodes.

Key words: weighted network, node importance, k-core algorithm, balance coefficient, complex network

摘要： 复杂网络节点的重要性排序是复杂网络研究的重要部分。在k核算法的基础上引入权重值,重新定义适用于加权网络的节点k核值。为了将权重对网络节点重要性的影响定量化,提出一种新的加权网络改进k核算法,并分析平衡系数的取值变化对算法结果的影响。仿真结果表明,该算法整体指标优于k核算法,具有调整平衡系数适应不同加权网络的特点,适用于进行加权网络节点重要性评价。

关键词: 加权网络, 节点重要性, k核算法, 平衡系数, 复杂网络

CLC Number: 

• TP301