Computer Science ›› 2019, Vol. 46 ›› Issue (11A): 348-353.

• Network & Communication • Previous Articles     Next Articles

Node Propagation Importance Algorithm for Multi-dimensional Complex Networks

ZHANG Xin, WANG Hui-hui, YAN Pei, GUO Yang   

  1. (School of Information,Liaoning University,Shenyang 110004,China)
  • Online:2019-11-10 Published:2019-11-20

Abstract: How to measure node importance in the network topology has always been a research hotspot in the field of complex networks.Most of the existing researches are oriented to single dimensional networks.Therefore,aiming at the fact that there is often a multi dimensional coexistence in real-world network structure,the definition of dimensional similarity was proposed to measure the relationship between dimensions.Considering the impact of information attenuation on node importance in actual process of information propagation,the definition of propagation attenuation rate is given.The value of attenuation coefficient is determined by propagation non-destructive assumption on a fully connected single dimensional network and corresponding algorithm.And the node importance algorithm is given further.The small network characteristics of the complex network are utilized in the given algorithm to limit the maximum propagation hops,so that the algorithm takes into account both time efficiency and accuracy.The experimental results on the real network show that the proposed algorithm has certain advantages in accuracy and time efficiency compared with traditional node degree and node betweenness methods.

Key words: Attenuation rate, Dimensional similarity, Maximum propagation hops, Multidimensional network, Node importance

CLC Number: 

  • TP301
[2]COSTA L F,OLIVEIRA JR O N,TRAVIESO G,et al.Analyzing and modeling real-world phenomena with complex networks:a survey of applications[J].Advances in Physics,2011,60(3):329-412.
[3]PEROZZI B,AL-RFOU R,SKIENA S.Deepwalk:Online learning of social representations[C]∥Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.ACM,2014:701-710.
[5]FREEMAN L C.A set of measures of centrality based on betweenness[J].Sociometry,1977:35-41.
[6]BOCCALETTI S,BIANCONI G,CRIADO R,et al.The structure and dynamics of multilayer networks[J].Physics Reports,2014,544(1):1-122.
[7]YU H,LIU Z,LI Y J.Key nodes in complex networks identified by multi-attribute decision-making method[J].2013.
[8]MENICHETTI G,REMONDINI D,PANZARASA P,et al.Weighted multiplex networks[J].PloS one,2014,9(6):e97857.
[9]SHCHUROV A A.A multilayer model of computer networks[J].arXiv:1509.00721,2015.
[10]BERLINGERIO M,COSCIA M,GIANNOTTI F,et al.Foundations of multidimensional network analysis[C]∥2011 International Conference on Advances in Social Networks Analysis and Mining (ASONAM).IEEE,2011:485-489.
[11]杨建祥,王朝坤,王萌,等.全动态多维网络局部介数中心度算法[J].计算机学报,2015(9):254-4164[12]BERLINGERIO M,COSCIA M,GIANNOTTI F,et al.Multidimensional networks:foundations of structural analysis[J].World Wide Web,2013,16(5/6):567-593.
[13]WATTS D J,STROGATZ S H.Collective dynamics of ‘small-world’networks[J].Nature,1998,393(6684):440.
[14]HENDRY J B.Rural Vietnam:The Small World of Khanh Hau[M].Routledge,2017.
[15]BO S,GUO-PING J,YU-RONG S,et al.Rapid identifying high-influence nodes in complex networks[J].Chinese Physics B,2015,24(10):100101.
[16]XU B,QI J,ZHOU C,et al.Hybrid self-adaptive algorithm for community detection in complex networks[J].Mathematical Problems in Engineering,2015,2015.
[17]SUH B,CONVERTINO G,CHI E H,et al.The singularity is not near:slowing growth of Wikipedia[C]∥International Symposium on Wikis and Open Collaboration.DBLP,2009:1-10.
[18]LOZANO S,ARENAS A,SÁNCHEZ A.Mesoscopic structure conditions the emergence of cooperation on social networks[J].Plos One,2008,3(4):e1892.
[1] MA Yuan-yuan, HAN Hua, QU Qian-qian. Importance Evaluation Algorithm Based on Node Intimate Degree [J]. Computer Science, 2021, 48(5): 140-146.
[2] LUO Jian-zhen,CAI Jun ,LIU Yan,ZHAO Hui-min. Caching and Replacing Strategy in Information-centric Network Based on Content Popularity and Community Importance [J]. Computer Science, 2018, 45(7): 116-121.
[3] MA Xue-bin, LI Ai-li, ZHANG Xiao-juan, JIA Lei-lei and XIAO Jing. Buffer Management Based on Stationary Relay Nodes and Message Correlation in Sparse Opportunistic Networks [J]. Computer Science, 2016, 43(Z11): 296-300.
[4] QIN Li, YANG Zi-long and HUANG Shu-guang. Synthesis Evaluation Method for Node Importance in Complex Networks [J]. Computer Science, 2015, 42(2): 60-64.
[5] ZHANG Yi,LIU Yu-hua,XU Kai-hua,LUO Zhen-rong. Evaluation Method for Node Importance Based on Mutual Information in Complex Networks [J]. Computer Science, 2011, 38(6): 88-89.
Full text



No Suggested Reading articles found!