【摘要】：對復雜網(wǎng)絡中節(jié)點的重要性進行排序在理論和現(xiàn)實中都有著重要的意義。傳統(tǒng)K-shell分解方法有著排序結果分辨率不高的缺陷,針對這一問題,提出了一種改進的K-shell方法,通過利用K-shell分解過程中節(jié)點被刪除時的迭代層數(shù)來進一步區(qū)分不同節(jié)點的重要性程度。在三類不同的現(xiàn)實網(wǎng)絡中的實驗表明,該方法能夠有效解決傳統(tǒng)方法的缺陷,在提高排序結果分辨率的同時有著較好的時間復雜度。
[Abstract]:Ranking the importance of nodes in complex networks is of great significance both in theory and in practice. The traditional K-shell decomposition method has the defect of low resolution of sorting result. In order to solve this problem, an improved K-shell method is proposed. By using the number of iterative layers when nodes are deleted during K-shell decomposition, the importance of different nodes is further distinguished. Experiments in three different real networks show that the proposed method can effectively solve the shortcomings of traditional methods and has better time complexity while improving the resolution of sorting results.
【作者單位】： 國家數(shù)字交換系統(tǒng)工程技術研究中心;
【基金】：國家自然科學基金資助項目(61171108) 國家“973”計劃資助項目(2012CB315901,2012CB315905) 國家科技支撐計劃資助項目(2014BAH30B01)
【分類號】：O157.5
，

本文編號：2137852