EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

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

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

Entropy · 21.08.2026 · 28 (8) · 935

DOI: 10.3390/e28080935 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Entropy, online erschienen am 21.08.2026. Verfasst von Na Zhao und 5 weiteren Autor:innen. Beteiligte Einrichtung: School of Software, Yunnan University, Kunming 650504, China. Die Arbeit nennt 71 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Natural Science Foundation of China, Key Research and Development Program of Yunnan Province, Special Fund for the Central Government to Guide Local Science.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Schlagwörter

Stichwörter der Autor:innen

complex networksglobal structural attributesinfluential node identificationlocal structural attributesmulti-attribute fusionneighbor contribution

Autor:innen und Institutionen

  • School of Software, Yunnan University, Kunming 650504, China.
  • College of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650500, China.

ORCID-Profile: Jian Wang

Förderung

  • National Natural Science Foundation of China
  • Key Research and Development Program of Yunnan Province
  • Special Fund for the Central Government to Guide Local Science
  • Yunnan University

Zitieren

APA

Zhao, N., Dai, C., Yang, G., Luo, T., Xiong, N., & Wang, J. (2026). An Evaluation Method for Influential Nodes Based on Multi-Attribute Neighbor Contributions in Complex Networks. Entropy, 28(8), 935. https://doi.org/10.3390/e28080935

Vancouver

Zhao N, Dai C, Yang G, Luo T, Xiong N, Wang J. An Evaluation Method for Influential Nodes Based on Multi-Attribute Neighbor Contributions in Complex Networks. Entropy. 2026;28(8):935. doi:10.3390/e28080935

BibTeX
@article{Zhao2026,
  author = {Zhao, Na and Dai, Chao and Yang, Guolin and Luo, Ting and Xiong, Nifei and Wang, Jian},
  title = {An Evaluation Method for Influential Nodes Based on Multi-Attribute Neighbor Contributions in Complex Networks},
  journal = {Entropy},
  year = {2026},
  volume = {28},
  number = {8},
  pages = {935},
  doi = {10.3390/e28080935}
}
Kostenlos starten →