2016•Unpublished venueRequires access

Identifying influential nodes in complex network based on weighted semi-local centrality

Wenfeng Kang, Guangming Tang, Yifeng Sun, Shuo Wang

Open publisher page 6 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Betweenness centrality, Centrality, Closeness, Node (physics), Network controllability, Computer science, Complex network, Katz centrality

Related papers

Back to paper searchBrowse research topicsOriginal source
Identifying influential nodes in complex network based on weighted semi-local centrality — Research Paper | ScholarLens