A mechanics model based on information entropy for identifying influencers in complex networks

被引:10
作者
Li, Shuyu [1 ,2 ]
Xiao, Fuyuan [2 ]
机构
[1] Tongji Univ, Shanghai Res Inst Intelligent Autonomous Syst, Shanghai 200092, Peoples R China
[2] Chongqing Univ, Sch Big Data & Software Engn, Chongqing 401331, Peoples R China
基金
中国国家自然科学基金;
关键词
Complex network; Crucial spreaders identification; Gravity model; Information entropy; INFLUENTIAL NODES; CENTRALITY; IDENTIFICATION; CLASSIFICATION;
D O I
10.1007/s10489-023-04457-z
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The network, with some or all characteristics of scale-free, self-similarity, self-organization, attractor and small world, is defined as a complex network. The identification of significant spreaders is an indispensable research direction in complex networks, which aims to discover nodes that play a crucial role in the structure and function of the network. Since influencers are essential for studying the security of the network and controlling the propagation process of the network, their assessment methods are of great significance and practical value to solve many problems. However, how to effectively combine global information with local information is still an open problem. To solve this problem, the generalized mechanics model is further improved in this paper. A generalized mechanics model based on information entropy is proposed to discover crucial spreaders in complex networks. The influence of each neighbor node on local information is quantified by information entropy, and the interaction between each node on global information is considered by calculating the shortest distance. Extensive tests on eleven real networks indicate the proposed approach is much faster and more precise than traditional ways and state-of-the-art benchmarks. At the same time, it is effective to use our approach to identify influencers in complex networks.
引用
收藏
页码:18450 / 18469
页数:20
相关论文
共 60 条
[1]  
Adamic Lada., 2005, P 3 INT WORKSHOP LIN, P36, DOI DOI 10.1145/1134271.1134277
[2]   FACTORING AND WEIGHTING APPROACHES TO STATUS SCORES AND CLIQUE IDENTIFICATION [J].
BONACICH, P .
JOURNAL OF MATHEMATICAL SOCIOLOGY, 1972, 2 (01) :113-120
[3]   Eigenvector-like measures of centrality for asymmetric relations [J].
Bonacich, P ;
Lloyd, P .
SOCIAL NETWORKS, 2001, 23 (03) :191-201
[4]   The anatomy of a large-scale hypertextual Web search engine [J].
Brin, S ;
Page, L .
COMPUTER NETWORKS AND ISDN SYSTEMS, 1998, 30 (1-7) :107-117
[5]   Thresholds for Epidemic Spreading in Networks [J].
Castellano, Claudio ;
Pastor-Satorras, Romualdo .
PHYSICAL REVIEW LETTERS, 2010, 105 (21)
[6]   Probability transformation of mass function: A weighted network method based on the ordered visibility graph [J].
Chen, Luyuan ;
Deng, Yong ;
Cheong, Kang Hao .
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2021, 105
[7]   Automatic seizure detection by convolutional neural networks with computational complexity analysis [J].
Cimr, Dalibor ;
Fujita, Hamido ;
Tomaskova, Hana ;
Cimler, Richard ;
Selamat, Ali .
COMPUTER METHODS AND PROGRAMS IN BIOMEDICINE, 2023, 229
[8]   Reaction-diffusion processes and metapopulation models in heterogeneous networks [J].
Colizza, Vittoria ;
Pastor-Satorras, Romualdo ;
Vespignani, Alessandro .
NATURE PHYSICS, 2007, 3 (04) :276-282
[9]   Information Volume of Mass Function [J].
Deng, Y. .
INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL, 2020, 15 (06) :1-13
[10]   Random Permutation Set [J].
Deng, Yong .
INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL, 2022, 17 (01)