Information Entropy Based on Propagation Feature of Node for Identifying the Influential Nodes

Linfeng Zhong, Yu Bai, Yan Tian, Chen Luo, Jin Huang, Weijun Pan and Chenquan Gan

Complexity, 2021, vol. 2021, 1-8

Abstract: For understanding and controlling spreading in complex networks, identifying the most influential nodes, which can be applied to disease control, viral marketing, air traffic control, and many other fields, is of great importance. By taking the effect of the spreading rate on information entropy into account, we proposed an improved information entropy (IIE) method. Compared to the benchmark methods in the six different empirical networks, the IIE method has been found with a better performance on Kendall’s Tau and imprecision function under the Susceptible Infected Recovered (SIR) model. Especially in the Facebook network, Kendall’s Tau can grow by 120% as compared with the original IE method. And, there is also an equally good performance in the comparative analysis of imprecise functions. The imprecise functions’ value of the IIE method is smaller than the benchmark methods in six networks.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/complexity/2021/5554322.pdf (application/pdf)
http://downloads.hindawi.com/journals/complexity/2021/5554322.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:5554322

DOI: 10.1155/2021/5554322

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().