ArticleScientific reports2016
Identifying a set of influential spreaders in complex networks.
Article in Scientific reports, 2016. The graph could read no effect estimate from its abstract, so it casts no vote on the map. An erratum has been issued. Cited by 51 papers.
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
51 citing papers in PubMed, 309 citations in OpenAlex.
- An Evaluation Method for Influential Nodes Based on Multi-Attribute Neighbor Contributions in Complex Networks.Entropy (Basel, Switzerland) · 2026Article
- Heuristic centrality methods challenge greedy optimization in influence maximization.Scientific reports · 2026Article
- Maximum independent set in multiplex social networks and its application to influence maximization.Scientific reports · 2025Article
- Influential nodes identification for complex networks based on multi-feature fusion.Scientific reports · 2025Article
- Understanding the Engagement and Interaction of Superusers and Regular Users in UK Respiratory Online Health Communities: Deep Learning-Based Sentiment Analysis.Journal of medical Internet research · 2025Article
- A novel voting measure for identifying influential nodes in complex networks based on local structure.Scientific reports · 2025Article
- Critical node detection in temporal social networks, based on global and semi-local centrality measures.PloS one · 2025Article
- Integrating graph and reinforcement learning for vaccination strategies in complex networks.Scientific reports · 2024Article
- Identifying Key Nodes for the Influence Spread Using a Machine Learning Approach.Entropy (Basel, Switzerland) · 2024Article
- Finding influential nodes in complex networks based on Kullback-Leibler model within the neighborhood.Scientific reports · 2024Article
- Mendelian randomization reveals interactions of the blood proteome and immunome in mitral valve prolapse.Communications medicine · 2024Article
- Enhancing Exchange-Traded Fund Price Predictions: Insights from Information-Theoretic Networks and Node Embeddings.Entropy (Basel, Switzerland) · 2024Article
- Natural Language Processing for Drug Discovery Knowledge Graphs: Promises and Pitfalls.Methods in molecular biology (Clifton, N.J.) · 2024Article
- Total network controllability analysis discovers explainable drugs for Covid-19 treatment.Biology direct · 2023Article
- Total network controllability analysis discovers explainable drugs for Covid-19 treatment.Research square · 2023Article
- User Real-Time Influence Ranking Algorithm of Social Networks Considering Interactivity and Topicality.Entropy (Basel, Switzerland) · 2023Article
- Influential nodes identification method based on adaptive adjustment of voting ability.Heliyon · 2023Article
- SpreadRank: A Novel Approach for Identifying Influential Spreaders in Complex Networks.Entropy (Basel, Switzerland) · 2023Article
- Article
- konnect2prot: a web application to explore the protein properties in a functional protein-protein interaction network.Bioinformatics (Oxford, England) · 2023Article
Corrections and comments
- Erratum issued
Authors and funding
4 authors at 1 institution in 1 country.
Funding
No grant is acknowledged in the PubMed record.
Abstract
Identifying a set of influential spreaders in complex networks plays a crucial role in effective information spreading. A simple strategy is to choose top-r ranked nodes as spreaders according to influence ranking method such as PageRank, ClusterRank and k-shell decomposition. Besides, some heuristic methods such as hill-climbing, SPIN, degree discount and independent set based are also proposed. However, these approaches suffer from a possibility that some spreaders are so close together that they overlap sphere of influence or time consuming. In this report, we present a simply yet effectively iterative method named VoteRank to identify a set of decentralized spreaders with the best spreading ability. In this approach, all nodes vote in a spreader in each turn, and the voting ability of neighbors of elected spreader will be decreased in subsequent turn. Experimental results on four real networks show that under Susceptible-Infected-Recovered (SIR) and Susceptible-Infected (SI) models, VoteRank outperforms the traditional benchmark methods on both spreading rate and final affected scale. What's more, VoteRank has superior computational efficiency.
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.