ArticleEntropy (Basel, Switzerland)2020
Influential Nodes Identification in Complex Networks via Information Entropy.
Article in Entropy (Basel, Switzerland), 2020. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 16 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
16 citing papers in PubMed.
- Measurement of influential nodes in networks based on community structure information entropy.Scientific reports · 2025Article
- Enhanced Key Node Identification in Complex Networks Based on Fractal Dimension and Entropy-Driven Spring Model.Entropy (Basel, Switzerland) · 2025Article
- Cascades Towards Noise-Induced Transitions on Networks Revealed Using Information Flows.Entropy (Basel, Switzerland) · 2024Article
- WI-TMLEGA: Weight Initialization and Training Method Based on Entropy Gain and Learning Rate Adjustment.Entropy (Basel, Switzerland) · 2024Article
- Finding influential nodes in complex networks based on Kullback-Leibler model within the neighborhood.Scientific reports · 2024Article
- Exploring the Entropy Complex Networks with Latent Interaction.Entropy (Basel, Switzerland) · 2023Article
- The Structure Entropy-Based Node Importance Ranking Method for Graph Data.Entropy (Basel, Switzerland) · 2023Article
- Detecting influential nodes with topological structure via Graph Neural Network approach in social networks.International journal of information technology : an official journal of Bharati Vidyapeeth's Institute of Computer Applications and Management · 2023Article
- The Self-Information Weighting-Based Node Importance Ranking Method for Graph Data.Entropy (Basel, Switzerland) · 2022Article
- Identifying Influential Nodes in Complex Networks Based on Multiple Local Attributes and Information Entropy.Entropy (Basel, Switzerland) · 2022Article
- Identifying Important Nodes in Complex Networks Based on Node Propagation Entropy.Entropy (Basel, Switzerland) · 2022Article
- Influential nodes identification using network local structural properties.Scientific reports · 2022Article
- COVID-19 Symptoms app analysis to foresee healthcare impacts: Evidence from Northern Ireland.Applied soft computing · 2022Article
- Role-Aware Information Spread in Online Social Networks.Entropy (Basel, Switzerland) · 2021Review
- Identifying critical higher-order interactions in complex networks.Scientific reports · 2021Article
- A Survey of Information Entropy Metrics for Complex Networks.Entropy (Basel, Switzerland) · 2020Review
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
Abstract
Identifying a set of influential nodes is an important topic in complex networks which plays a crucial role in many applications, such as market advertising, rumor controlling, and predicting valuable scientific publications. In regard to this, researchers have developed algorithms from simple degree methods to all kinds of sophisticated approaches. However, a more robust and practical algorithm is required for the task. In this paper, we propose the EnRenew algorithm aimed to identify a set of influential nodes via information entropy. Firstly, the information entropy of each node is calculated as initial spreading ability. Then, select the node with the largest information entropy and renovate its
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.