摘要
K-核分解方法对于识别复杂网络传播动力学中最重要节点具有重要的价值,然而该方法无法对复杂网络中大量最小K-核节点的传播能力进行准确度量.本文主要考察最小K-核节点的传播行为,利用其邻居的K-核信息,提出一种度量这类节点传播能力的方法.实证网络数据集的传播行为仿真结果表明,该方法与度、介数等指标相比更能准确度量最小K-核节点的传播能力.
The K-shell decomposition for identifying influential nodes plays an important role in analyzing the spreading performance in complex networks,which generates lots of nodes with the smallest K-shell value.The spreading influences of these nodes cannot be distinguished by the K-shell decomposition method,as well as the degree and betweeness indices.In this paper,by taking into account the K-shell information of the target node,we develop a new method to identify the node spreading ability with the minimum K-shell value.The experimental results for pretty good privacy and autonomous system networks show that the presented method could generate more accurate spreading list than the degree and betweeness indices.
出处
《物理学报》
SCIE
EI
CAS
CSCD
北大核心
2013年第10期466-471,共6页
Acta Physica Sinica
基金
国家自然科学基金(批准号:71071098
71171136
91024026)
上海市青年科技启明星计划(A类)(批准号:11QA1404500)
上海市教委科研创新项目(批准号:11ZZ135
11YZ110)
教育部科学技术研究重点项目(批准号:211057)
上海市一流学科(系统科学)建设项目(批准号:XTKX2012)
上海市研究生创新基金(批准号:5411115004)资助的课题~~
关键词
复杂网络
传播能力
K-核分解
最小K-核节点
complex network
spreading performance
K-shell decomposition
minimum K-shell
