摘要
依据网络中节点的局域特征,提出了一种简单的节点重要性的度量方法.其主要原则是网络中节点的重要性不但与节点本身的度具有一定的关系,而且与节点的邻居节点的度也存在一定的关联.实验结果表明:该方法能够在不了解网络全局拓扑架构的基础上,比较细致地描述网络中各节点之间的差异性,而且算法时间复杂度仅为o(m+n〈k〉),因此对于大型复杂网络也可以获得理想的计算能力.
According to the local characteristics of network nodes,a simple measure method to quantify node is proposed.The principle of this method lies in that the importance of network nodes is not only related to the degree of the nodes themselves,but also related to the degrees of their neighborhood nodes.The experimental results show that the presented method is still valid in the condition that it lacks the global topological structure information of the network.It could well describe the differences among nodes and its time complexity is only o（m＋n〈k〉）.Hence,this method could acquire a high performance when dealing with the large scale complex network.
出处
《大连理工大学学报》
EI
CAS
CSCD
北大核心
2010年第5期822-826,共5页
Journal of Dalian University of Technology
基金
国家自然科学基金资助项目(70571011
70771016)
关键词
复杂网络
度
局部特征
时间复杂度
complex network
degree
local characteristics
time complexity
