Identifying influential nodes in complex networks: a semi-local centrality measure based on augmented graph and average shortest path theory

Pan Han-huai (), Wang Lin-wei (), Liu Hao () and MohammadJavad Abdollahi ()
Additional contact information
Pan Han-huai: Shanghai Jian Qiao University
Wang Lin-wei: Shanghai Jian Qiao University
Liu Hao: China University of Mining and Technology
MohammadJavad Abdollahi: University of Lian Bushehr

Telecommunication Systems: Modelling, Analysis, Design and Management, 2025, vol. 88, issue 1, No 25, 18 pages

Abstract: Abstract Identifying influential nodes in complex networks is a crucial problem in network analysis with broad applications in various fields such as bioinformatics, social engineering, and information dissemination. Existing methods for identifying influential nodes often face challenges such as ignoring semantic relationships and inefficiencies in large-scale networks. This paper presents an efficient multidimensional centrality measure (EMDC) for complex networks that integrates multiple aspects of node influence to address these challenges. The strength of relationships between nodes is obtained through the degree of neighborhood overlap by integrating degree and entropy information. Meanwhile, EMDC combines degree centrality with the k-shell measure to enhance the identification of seed nodes. EMDC develops an augmented graph to measure semantic similarity between nodes by representing distant relationships. Also, EMDC can extract a local subgraph for each node in a distributed manner. Meanwhile, the average shortest path theory, redefined with a semi-local structure, addresses the issue of identifying influential nodes in large-scale networks. The Susceptible-Infected (SI) model and Kendall’s correlation coefficient are used to evaluate the performance of our centrality measure. Experimental results on real-world datasets confirm the superiority of EMDC.

Keywords: Complex networks; Influential nodes; Multidimensional centrality; Semi-local structure; Augmented graph; Average shortest path (search for similar items in EconPapers)
Date: 2025
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s11235-024-01240-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:telsys:v:88:y:2025:i:1:d:10.1007_s11235-024-01240-4

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/11235

DOI: 10.1007/s11235-024-01240-4

Access Statistics for this article

Telecommunication Systems: Modelling, Analysis, Design and Management is currently edited by Muhammad Khan

More articles in Telecommunication Systems: Modelling, Analysis, Design and Management from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().