Identifying influential nodes in complex network based on weighted semi-local centrality
Wenfeng Kang, Guangming Tang, Yifeng Sun, Shuo Wang
Abstract
Wenfeng Kang, Guangming Tang, Yifeng Sun, Shuo Wang
Abstract
Aiming at the problem that it is difficult to identify the influential nodes in complex network when risk comes, a weighted semi-local centrality measure which conquers the defect of semi-local centrality is proposed, and the method not only synthesizes the degree and weight of a node but also considers information of multiple layer neighbors of nodes. To evaluate the performance, the Susceptible-Infected(SI) model is used to estimate the spreading influence of the top-ranked nodes by different centrality. The experimental results on two simple weighted network and a real network show that our method can well identify influential nodes, and much better than degree and betweenness centrality ones, and almost as good as the ESC method and the closeness centrality measure while with much lower computational complexity.
OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Aiming at the problem that it is difficult to identify the influential nodes in complex network when risk comes, a weighted semi-local centrality measure which conquers the defect of semi-local centrality is proposed, and the method not only synthesizes the degree and weight of a node but also considers information of multiple layer neighbors of nodes. To evaluate the performance, the Susceptible-Infected(SI) model is used to estimate the spreading influence of the top-ranked nodes by different centrality. The experimental results on two simple weighted network and a real network show that our method can well identify influential nodes, and much better than degree and betweenness centrality ones, and almost as good as the ESC method and the closeness centrality measure while with much lower computational complexity.
Key concepts: Betweenness centrality, Centrality, Closeness, Node (physics), Network controllability, Computer science, Complex network, Katz centrality