An Evaluation Method for Influential Nodes Based on Multi-Attribute Neighbor Contributions in Complex Networks

Accurately identifying influential nodes is essential for analyzing network structures and optimizing information propagation. Existing methods predominantly rely on single indicators such as degree, H-index, or k-shell, inherently limiting their ability to capture a node’s true influence. Recent hybrid centrality approaches attempt to address this by combining multiple local and global attributes; however, they typically integrate features through simple weighting or superposition, failing to characterize the intrinsic synergy among structural properties. Furthermore, they often quantify neighbor contributions too coarsely, overlook the regulatory role of edge strength, and some suffer from high computational complexity, limiting scalability. To overcome these deficiencies, we propose WKDH, a novel influential node identification method based on multi-attribute neighbor contributions. WKDH fuses local structural attributes (degree and H-index) with global structural attributes (k-shell) via a multiplicative weighted synergy model, simultaneously capturing local connection “quantity,” local connection “quality,” and global core-layer position. By transforming neighbors’ comprehensive characteristics into regulated contribution degrees, WKDH mitigates excessive self-attribute interference and accurately reflects the actual propagation potential of edges. Notably, the method achieves linear computational complexity of O(m). Experimental results on nine real-world and six artificial networks demonstrate that WKDH outperforms nine established indicators in terms of node influence ranking, identification of high-influence nodes, and measuring propagation capability. Moreover, WKDH exhibits strong universality across diverse network structures, as it operates without parameter tuning.

Authors

Institutions

Publication Details

Journal
Entropy
Published
2026-08-21
DOI
https://doi.org/10.3390/e28080935
Primary Topic
Complex Network Analysis Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Evaluation Method for Influential Nodes Based on Multi-Attribute Neighbor Contributions in Complex Networks

Na Zhao, Ting Luo, Jian Wang, Guolin Yang et al.
Entropy
Complex Network Analysis Techniques
article

An Evaluation Method for Influential Nodes Based on Multi-Attribute Neighbor Contributions in Complex Networks

Na Zhao, Ting Luo, Jian Wang, Guolin Yang, Chao Dai, Nifei Xiong
article en

Abstract

Accurately identifying influential nodes is essential for analyzing network structures and optimizing information propagation. Existing methods predominantly rely on single indicators such as degree, H-index, or k-shell, inherently limiting their ability to capture a node’s true influence. Recent hybrid centrality approaches attempt to address this by combining multiple local and global attributes; however, they typically integrate features through simple weighting or superposition, failing to characterize the intrinsic synergy among structural properties. Furthermore, they often quantify neighbor contributions too coarsely, overlook the regulatory role of edge strength, and some suffer from high computational complexity, limiting scalability. To overcome these deficiencies, we propose WKDH, a novel influential node identification method based on multi-attribute neighbor contributions. WKDH fuses local structural attributes (degree and H-index) with global structural attributes (k-shell) via a multiplicative weighted synergy model, simultaneously capturing local connection “quantity,” local connection “quality,” and global core-layer position. By transforming neighbors’ comprehensive characteristics into regulated contribution degrees, WKDH mitigates excessive self-attribute interference and accurately reflects the actual propagation potential of edges. Notably, the method achieves linear computational complexity of O(m). Experimental results on nine real-world and six artificial networks demonstrate that WKDH outperforms nine established indicators in terms of node influence ranking, identification of high-influence nodes, and measuring propagation capability. Moreover, WKDH exhibits strong universality across diverse network structures, as it operates without parameter tuning.

EntropyVol. 28(8)
Kunming University of Science and Technology (CN), Yunnan University (CN)
National Natural Science Foundation of China, Yunnan University
Openalex Percentile: Top 9%
Complex Network Analysis Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.