Focal Interest
Focal Interest
AI Summary of Peer-Reviewed Research

This page presents an AI-generated summary of a published research paper. The original authors did not write or review this article. [See full disclosure ↓]

Publishing process signals: STRONG — reflects the venue and review process. — venue and review process.

HKEN improved influential-node identification in network tests

A laptop displaying a purple network graph visualization with nodes and connections, positioned on a desk in a modern workspace with a blurred office environment in the background.
Research area:Physics and AstronomyGraph Theory and AlgorithmsComplex Network Analysis Techniques

What the study found

HKEN, an algorithm for identifying influential nodes in complex networks, performed better than the compared methods in the study. The authors report that it showed higher consistency with SIR model outcomes and improved the propagation capability of top-ranked nodes.

Why the authors say this matters

The authors say influential-node identification has extensive applications in complex network research. The study suggests HKEN may help balance accuracy and computational efficiency while using both global structural features and local topological information.

What the researchers tested

The researchers proposed HKEN, which integrates hierarchical k-shell decomposition with extended neighborhood information. The method dynamically computes initial node weights from degree and k-shell values, extends the neighborhood range, uses a local clustering coefficient to set a threshold for information transmission distance, and applies an influence aggregation strategy based on the Jaccard similarity coefficient.

What worked and what didn't

In comparative experiments on 10 real-world networks against 12 benchmark methods, the proposed method showed higher consistency with SIR model outcomes. The abstract also states that it enhanced the propagation capability of top-ranked nodes.

What to keep in mind

The summary does not describe specific limitations, and no negative results are reported in the abstract. The evidence described here is limited to comparative experiments on 10 real-world networks.

Key points

  • HKEN is an algorithm for identifying influential nodes in complex networks.
  • The study reports higher consistency with SIR model outcomes than benchmark methods.
  • The method uses hierarchical k-shell decomposition, extended neighborhood information, and Jaccard similarity.
  • Tests were conducted on 10 real-world networks against 12 benchmark methods.
  • The abstract says the method improved the propagation capability of top-ranked nodes.

Disclosure

Research title:
HKEN improved influential-node identification in network tests
Authors:
Feifei Wang, Zejun Sun, Guan Wang, Haifeng Hu, Xiaoyan Sun, Shimeng Zhang
Institutions:
Pingdingshan University
Publication date:
2026-02-23
DOI:
10.1038/s41598-026-40209-y
OpenAlex record:
View
AI provenance: This post was generated by OpenAI. The original authors did not write or review this post.

More posts