Evidential identification of influential nodes in network of networks

被引:93
作者
Li, Meizhu [1 ,2 ,3 ]
Zhang, Qi [1 ,4 ]
Deng, Yong [1 ]
机构
[1] Univ Elect Sci & Technol China, Inst Fundamental & Frontier Sci, Chengdu 610054, Sichuan, Peoples R China
[2] Univ Ghent, Dept Telecommun & Informat Proc, Sint Pietersnieuwstr 41, B-9000 Ghent, Belgium
[3] Univ Ghent, Dept Elect & Informat Syst, ID Lab, Technol Pk Zwijnaarde 914, B-9052 Ghent, Belgium
[4] Leiden Univ, Lorentz Inst Theoret Phys, POB 9504, NL-2300 RA Leiden, Netherlands
基金
中国国家自然科学基金;
关键词
Network of networks; Influential nodes; Dempster Shafer evidence theory; Belief function; Complex networks; COMPLEX NETWORKS; SIMILARITY MEASURE; CENTRALITY; DYNAMICS;
D O I
10.1016/j.chaos.2018.04.033
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Network theory has been widely used to describe complex systems in the real world. However, following the research of networks science, a network with one relationship in it can not be used in a multi-relationship complex system. Therefore, new network models were proposed to describe different relationships between real systems, such as Multilayers Networks, Multiplex Networks, Interconnected Networks and Network of Networks (NON). One type of NON has the same nodes but different relationship between nodes in different layers. This work focuses on this type of NON. In this paper, a new method is proposed to identify the influential nodes in the NON mentioned above based on evidence theory. Depending on the new method, influence of each node in different layer is fused by combination rules of evidence theory. Thus, results of fusion are used to quantify the influence of each node in NON to identify the influential nodes. Here we use the China transport networks, which can be regarded as a NON, to test the new method. The results of experiment show that the new method has smaller information loss during calculation and it is a reasonable method to identify influential nodes in a NON. (C) 2018 Elsevier Ltd. All rights reserved.
引用
收藏
页码:283 / 296
页数:14
相关论文
共 68 条
[1]  
[Anonymous], COMPUT ENG APPL
[2]  
[Anonymous], 2006, The structure and dynamics of networks
[3]   Synchronization in complex networks [J].
Arenas, Alex ;
Diaz-Guilera, Albert ;
Kurths, Jurgen ;
Moreno, Yamir ;
Zhou, Changsong .
PHYSICS REPORTS-REVIEW SECTION OF PHYSICS LETTERS, 2008, 469 (03) :93-153
[4]   Betweenness centrality in large complex networks [J].
Barthélemy, M .
EUROPEAN PHYSICAL JOURNAL B, 2004, 38 (02) :163-168
[5]   Structural measures for multiplex networks [J].
Battiston, Federico ;
Nicosia, Vincenzo ;
Latora, Vito .
PHYSICAL REVIEW E, 2014, 89 (03)
[6]   Interest communities and flow roles in directed networks: the Twitter network of the UK riots [J].
Beguerisse-Diaz, Mariano ;
Garduno-Hernandez, Guillermo ;
Vangelov, Borislav ;
Yaliraki, Sophia N. ;
Barahona, Mauricio .
JOURNAL OF THE ROYAL SOCIETY INTERFACE, 2014, 11 (101)
[7]   Identifying influential nodes in complex networks: A node information dimension approach [J].
Bian, Tian ;
Deng, Yong .
CHAOS, 2018, 28 (04)
[8]   Failure mode and effects analysis based on D numbers and TOPSIS [J].
Bian, Tian ;
Zheng, Haoyang ;
Yin, Likang ;
Deng, Yong .
QUALITY AND RELIABILITY ENGINEERING INTERNATIONAL, 2018, 34 (04) :501-515
[9]   The structure and dynamics of multilayer networks [J].
Boccaletti, S. ;
Bianconi, G. ;
Criado, R. ;
del Genio, C. I. ;
Gomez-Gardenes, J. ;
Romance, M. ;
Sendina-Nadal, I. ;
Wang, Z. ;
Zanin, M. .
PHYSICS REPORTS-REVIEW SECTION OF PHYSICS LETTERS, 2014, 544 (01) :1-122
[10]   UPPER AND LOWER PROBABILITIES INDUCED BY A MULTIVALUED MAPPING [J].
DEMPSTER, AP .
ANNALS OF MATHEMATICAL STATISTICS, 1967, 38 (02) :325-&