Skip to content
Open access

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

Aug 2026 · Entropy · Vol 28 · 0 citations · 73 references
Medicine

TL;DR

WKDH fuses local structural attributes with global structural attributes via a multiplicative weighted synergy model, simultaneously capturing local connection “quantity,” local connection “quality,” and global core-layer position, and achieves linear computational complexity of O(m).

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.

Read PDF

Similar papers

Jul 2026

A Novel Gravity-Quasi-Laplacian Approach to Identifying Influential Nodes in Complex Networks

This study introduces a new ranking framework that integrates a quasi-Laplacian structural measure with a gravity-inspired aggregation process and demonstrates that the proposed framework consistently outperforms existing techniques in terms of accuracy, resolution, and computational simplicity.

Shima Esfandiari, S. M. Fakhrahmad · 0 citations
Open access Aug 2026

Objective Multi-Metric Fusion for Critical Node Identification via CRITIC and Global–Local Context Modeling

Accurately identifying critical nodes in complex networks and applying targeted protection strategies significantly enhances network security. Traditional importance metrics rely on a single topological feature and cannot fully capture node influence. Existing multi-attribute fusion methods integrate multiple structura...

Peng-Cheng Cai, Canjv Lu, Ying Huang et al. · 0 citations
Aug 2026

K-Core Neighborhood Density: Mixing Local and Global Features for Influential Node Detection

Experimental results in seven complex networks of the real world show that the proposed hybrid centrality called k-core neighborhood density (KND) remarkably balances rank distribution and accuracy, and the identified influential nodes have a superior ability to spread their influence over a wide area of a network.

Sourav Kumar Mitra, Susanta Chakraborty, Malay Kule · 0 citations
Aug 2026

INFUSE: Influential Node Identification in Multilayer Networks using Multiscale Feature Fusion

A model for identifying influence nodes in multilayer networks that leverages multilayer feature fusion, encompassing intra-layer features, weighted centrality features, and inter-layer structural features is proposed, which outperforms classical and heuristic baselines in terms of resilience, generalization, and robus...

Shristi Achari, R. Beniwal, Sanjay Kumar · 0 citations
Book Open access Aug 2026

Scalable Algorithms for Information Centrality Optimization via Global Edge Addition

This work proposes two scalable greedy algorithms based on gradient-guided edge selection that efficiently approximate marginal gains and prune the candidate edge set and achieves optimization performance comparable to exact greedy strategies while substantially reducing computational time.

Runze Zhang, Gengyu Wang, Zhongzhi Zhang · 0 citations
Preprint Aug 2026

Spectral Efficiency Centrality: An Efficient Spectral Approach for Influential Node Identification in Temporal Networks

Spectral Efficiency Centrality (SEC), a temporal spectral centrality framework that quantifies node importance by evaluating the change in spectral radius caused by node removal across temporal snapshots, and ASEC, an efficient approximation based on Perron-Frobenius theory and first-order eigenvalue perturbation that...

Aksa Urooj, Iqra Altaf Gillani · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.