摘要
复杂网络中的节点传播能力度量具有十分重要的意义,有助于抑制谣言扩散、疾病传播等。研究者们普遍用度量节点传播能力,然而度指标忽略了邻居节点的重要程度。文中考虑邻居节点度信息,提出了一种新的度量节点传播能力方法。该方法通过计算邻居节点度的α次方的和来度量节点的传播能力。通过α调整邻居节点对目标节点的重要程度,α越大,度大的邻居节点对目标节点的贡献越大。实验结果表明,在最优值α情况下,文中提出的算法相对于度和K-核分解方法能更加准确地度量节点的传播能力。文中提出的度量方法只考虑邻居节点度信息,因此非常适合于大规模网络的节点传播能力度量。
It is significant to evaluate the node spreading influence both theory and practice which can help us to suppress the spread of rumors or hinder the disease spreading. Degree is used to ranking the node spreading influence. However. degree is the number of the neighbors regardless of the difference of the neighbors. This paper presents an improved method which is the sum of the neighbors＇ degree with a tunable parameter α. For small α,the improved method would weaken the neighbors＇ influence for a target node. While large α would strengthen the neighbors＇ influence. The simulation result for four real networks show that the method with optimal parameter α could evaluate the node spreading influence more accurately than the ones generated by degree and K-shell method. The method only takes into account the neighbors＇ degree information which can be used to rank the node spreading influence for large scale networks.
出处
《信息技术》
2016年第5期19-21,共3页
Information Technology
基金
国家自然科学基金(70971089)
上海市一流学科(系统科学)项目资助(XTKX2012)
上海市研究生创新基金项目(JWCXSL1302)
