ArticleScientific reports2025
Identifying influential spreaders based on improving communication transmission model and network structure.
Article in Scientific reports, 2025. 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
6 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
The identification of key nodes has garnered considerable attention across various research domains, including commercial marketing, infectious disease prevention and control, road network optimization, intelligent electricity management, and Chinese medicine formulation design. To evaluate critical nodes within complex networks, numerous algorithms have been proposed. However, these methods exhibit certain limitations such as one-sided considerations and single evaluation indexes. Consequently, the applicability of these key node identification approaches is limited to specific scenarios. In this paper, we propose a novel method for identifying key nodes based on principles from communication transmission theory and the law of gravity. Our approach fully explores the network structure and node relationships, integrating the Shannon channel capacity model and the gravity model. This method not only considers a node's own location and importance, but also the proximity of its neighbors to the target node within two hops. Through extensive experimentation, we demonstrate that our algorithm outperforms representative methods proposed in recent years in terms of consistency with the SIR model, similarity of Top-N nodes, and node importance differentiation. Real-world experiments conducted on COVID-19 networks further validate the effectiveness of our approach.
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.