ArticleScientific reports2026
Towards a hierarchical approach and scalable semi-local centrality for key node identification in weighted complex networks.
Article in Scientific reports, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
3 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
The analysis of complex networks is crucial for understanding the structural and functional dynamics of real-world systems. Identifying key nodes in weighted complex networks represents a fundamental challenge in network science, as such nodes often play pivotal roles in information diffusion, resilience, and control processes. Traditional centrality metrics, which primarily rely on single-feature criteria, frequently suffer from limitations in scalability and sensitivity to network topology. These methods often overlook dynamic factors, unequal neighbor influence, and evolving structural risks, thereby reducing their ability to effectively distinguish key nodes in large, weighted, and heterogeneous systems. To address these limitations, this study proposes a Hierarchical and Scalable Semi-Local Centrality (HSSLC) framework designed to efficiently capture both local and semi-local structural influences in complex networks. We convert unweighted networks into weighted networks using their degree. HSSLC integrates multi-level entropy-based neighborhood information to balance local connectivity strength with the global propagation of influence. The proposed metric constructs weighted local subgraphs through multi-step connectivity to enhance computational efficiency when dealing with large-scale networks. Furthermore, a hierarchical key node identification algorithm is introduced, incorporating diverse node attributes across the entire network. Entropy-based evaluation that accounts for neighboring node contributions yields more reliable local influence assessment than degree-based indices. Experimental validation using real-world networks under the susceptible–infected–removed (SIR) diffusion model demonstrates that the proposed metric achieves up to a 2.8% improvement in Kendall’s rank correlation, while exhibiting superior scalability and computational efficiency compared to existing centrality metrics.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.