Generalization of Relative Change in a Centrality Measure to Identify Vital Nodes in Complex Networks

Identifying vital nodes is important in disease research, spreading rumors, viral marketing, and drug development. The vital nodes in any network are used to spread information as widely as possible. Centrality measures such as Degree centrality (D), Betweenness centrality (B), Closeness centrality...

Full description

Saved in:
Bibliographic Details
Published in:IEEE access 2023, Vol.11, p.808-824
Main Authors: Hajarathaiah, Koduru, Enduri, Murali Krishna, Dhuli, Sateeshkrishna, Anamalamudi, Satish, Cenkeramaddi, Linga Reddy
Format: Article
Language:English
Subjects:
Clustering
Complex networks
Complexity
influential nodes
Laplace equations
local centrality
Machine learning
Networks
Nodes
Object recognition
relative change in centrality
Time complexity
Time measurement
Volume measurement
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Identifying vital nodes is important in disease research, spreading rumors, viral marketing, and drug development. The vital nodes in any network are used to spread information as widely as possible. Centrality measures such as Degree centrality (D), Betweenness centrality (B), Closeness centrality (C), Katz (K), Cluster coefficient (CC), PR (PageRank), LGC (Local and Global Centrality), ISC (Isolating Centrality) centrality measures can be used to effectively quantify vital nodes. The majority of these centrality measures are defined in the literature and are based on a network's local and/or global structure. However, these measures are time-consuming and inefficient for large-scale networks. Also, these measures cannot study the effect of removal of vital nodes in resource-constrained networks. To address these concerns, we propose the six new centrality measures namely GRACC, LRACC, GRAD, LRAD, GRAK, and LRAK. We develop these measures based on the relative change of the clustering coefficient, degree, and Katz centralities after the removal of a vertex. Next, we compare the proposed centrality measures with D, B, C, CC, K, PR, LGC, and ISC to demonstrate their efficiency and time complexity. We utilize the SIR (Susceptible-Infected-Recovered) and IC (Independent Cascade) models to study the maximum information spread of proposed measures over conventional ones. We perform extensive simulations on large-scale real-world data sets and prove that local centrality measures perform better in some networks than global measures in terms of time complexity and information spread. Further, we also observe the number of cliques drastically improves the efficiency of global centrality measures.
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2022.3232288