發(fā)布時間：2018-10-30 16:21

【摘要】：基于標簽傳播動力學提出了一種識別網(wǎng)絡(luò)關(guān)鍵節(jié)點的算法,主要思想是把每個節(jié)點接收到不同標簽的數(shù)量作為判斷節(jié)點重要性的指標。應(yīng)用兩種不同的傳播模型,在不同網(wǎng)絡(luò)上與其它中心性指標作比較。結(jié)果表明:基于標簽傳播的中心性指標比其它的中心性方法可以更好地識別網(wǎng)絡(luò)中的關(guān)鍵節(jié)點�；�于標簽傳播的中心性指標還具有以下優(yōu)勢:不需要利用網(wǎng)絡(luò)的結(jié)構(gòu)信息,因此可以推廣到大規(guī)模網(wǎng)絡(luò)上;揭示了一種現(xiàn)象——好的接收者往往也是好的傳播者。
[Abstract]:Based on label propagation dynamics, an algorithm is proposed to identify the key nodes in the network. The main idea is to take the number of different tags received by each node as the index to judge the importance of the nodes. Two different propagation models are used to compare with other central indexes in different networks. The results show that the centrality index based on label propagation can better identify the key nodes in the network than other centrality methods. The central index based on label propagation also has the following advantages: it does not need to use the structural information of the network, so it can be extended to large-scale networks; it reveals a phenomenon that good receivers are often good communicators.
【作者單位】： 安徽大學數(shù)學科學學院;
【基金】：國家自然科學基金(61473001) 博士啟動資金(01001951)
【分類號】：O157.5

【相似文獻】

相關(guān)期刊論文 前10條

1 鐘柯;肖昱;許s，

本文編號：2300517