摘要
在一个实际的航空交通控制网络上,引入PageRank算法进行重要节点排序。为论证PageRank算法对于网络中重要节点的识别能力,将其与其他三种节点排序方法进行对比。通过灾害蔓延动力学模型进行模拟验证,结果表明:相比于其他三种排序方法,PageRank算法具有较强的重要节点识别能力,可以用于基础设施网络上重要节点的排序。
In an actual air traffic control network,the PageRank algorithm was introduced to identify the influential nodes. The PageRank algorithm was compared with three other ranking approaches to demonstrate the its ability of identifying influential nodes. We simulated and verified through a disaster spreading dynamical model. The results show that comparing with the other three ranking methods,the PageRank algorithm has a stronger ability to identify influential nodes,and it can be used to rank influential nodes in infrastructure network.
引文
[1]Bianconi G,Barabási A L.Bose-Einstein condensation in complex networks[J].Physical Review Letters,2001,86(24):5632-5635.
[2]Beggs J M,Plenz D.Neuronal avalanches in neocortical circuits[J].Journal of Neuroscience the Official Journal of the Society for Neuroscience,2003,23(35):11167-11177.
[3]Lambiotte R,Blondel V D,Kerchove C D,et al.A gravity model for the geographical dispersal of mobile communication networks[EB].ar Xiv:0802.2178,2008.
[4]Valentini L,Perugini D,Poli G.The small-world topology of rock fracture networks[J].Physica A,2007,377:323-328.
[5]Albert R.Diameter of the World Wide Web[J].Nature,1999,401:130-131.
[6]Buzna L,Peters K,Helbing D.Modelling the dynamics of disaster spreading in networks[J].Physica A,2006,363:132-140.
[7]Ormerod P,Roach A P.The medieval inquisition:scale-free networks and the suppression of heresy[J].Physica A,2004,339:645-652.
[8]孙可,韩祯祥,曹一家.复杂电网连锁故障模型评述[J].电网技术,2005,29(13):1-9.
[9]郭静,王东蕊.基于复杂网络理论的电力通信网脆弱性分析[J].电力系统通信,2009,30(9):6-10.
[10]刘忠华,于华,杨方廷.基于复杂网络理论的水网节点重要性评价研究[J].中国科学:科学技术,2014,44(12):1280-1294.
[11]刘宏鲲,周涛.航空网络研究综述[J].自然科学进展,2008,18(6):601-608.
[12]李泽荃,张瑞新,杨瞾,等.复杂网络中心性对灾害蔓延的影响[J].物理学报,2012,61(23):557-563.
[13]Mother A E,Lai Y C.Cascade-based attacks on complex networks[J].Physical Review E,2002,66:065102.
[14]Tan Y,Wu J,Deng H.Rapid identifying high-influence nodes in complex networks[J].Syst.Eng.Theory,2006,11:79-85.
[15]Freeman L C.Centrality in social networks conceptual clarification[J].Social Networks,1978,1(3):215-239.
[16]Kitsak M,Gallos L K,Havlin S,et al.Identification of influential spreaders in complex networks[J].Nature Physics,2010,6(11):888-893.
[17]Altmann M.Reinterpreting network measures for models of disease transmission[J].Social Networks,1993,15(1):1-17.
[18]Estrada E,Rodríguez-Velázquez J A.Subgraph centrality in complex networks[J].Physical Review E Statistical Nonlinear&Soft Matter Physics,2005,71(5 Pt 2):056103.
[19]任晓龙,吕琳媛.网络重要节点排序方法综述[J].科学通报,2014,59(13):1175-1197.
[20]LüL,Zhang Y C,Chi H Y,et al.Leaders in Social Networks,the Delicious Case[J].Plos One,2011,6(6):e21202.
[21]Ma N,Guan J,Zhao Y.Bringing PageRank to the citation analysis[J].Information Processing&Management,2008,44(2):800-810.
[22]Peng X L,Xu X J,Fu X,et al.Vaccination intervention on epidemic dynamics in networks[J].Physical Review E Statistical Nonlinear&Soft Matter Physics,2013,87(2):022813.
[23]Brummitt C D,D'Souza R M,Leicht E A.Suppressing cascades of load in interdependent networks[J].Proceedings of the National Academy of Sciences of the United States of A-merica,2012,109(12):4345-4346.
[24]LüL,Chen D B,Zhou T.Small world yields the most effective information spreading[J].New Journal of Physics,2011,13(12):825-834.
