Evidence map›Paper›PMID 32060330›Full record

ArticleScientific reports2020

Identifying vital nodes in complex networks by adjacency information entropy.

Xiang Xu, Cheng Zhu, Qingyong Wang, Xianqiang Zhu, Yun Zhou

Abstract read
In one paragraph

Article in Scientific reports, 2020. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 13 papers.

0numbers the graph read from it
0cells of the map it votes in
13citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

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.

2 · The registry

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.

3 · Its place in the literature

Who cites it

13 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. Article
  10. Article
  11. Article
  12. Article
  13. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

Xiang XuScience and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, Changsha, 410072, China. xuxiang19@nudt.edu.cn.ORCID http://orcid.org/0000-0002-3031-2561
Cheng ZhuScience and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, Changsha, 410072, China. zhucheng@nudt.edu.cn.
Qingyong WangScience and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, Changsha, 410072, China.
Xianqiang ZhuScience and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, Changsha, 410072, China.
Yun ZhouScience and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, Changsha, 410072, China.

Funding

Hunan Provincial Innovation Foundation for Postgraduate CX20190041National Natural Science Foundation of China (National Science Foundation of China) 61703416National Natural Science Foundation of China (National Science Foundation of China) 71571186
6 · The paper itself

Abstract

Identifying the vital nodes in networks is of great significance for understanding the function of nodes and the nature of networks. Many centrality indices, such as betweenness centrality (BC), eccentricity centrality (EC), closeness centricity (CC), structural holes (SH), degree centrality (DC), PageRank (PR) and eigenvector centrality (VC), have been proposed to identify the influential nodes of networks. However, some of these indices have limited application scopes. EC and CC are generally only applicable to undirected networks, while PR and VC are generally used for directed networks. To design a more applicable centrality measure, two vital node identification algorithms based on node adjacency information entropy are proposed in this paper. To validate the effectiveness and applicability of the proposed algorithms, contrast experiments are conducted with the BC, EC, CC, SH, DC, PR and VC indices in different kinds of networks. The results show that the index in this paper has a high correlation with the local metric DC, and it also has a certain correlation with the PR and VC indices for directed networks. In addition, the experimental results indicate that our algorithms can effectively identify the vital nodes in different networks.

Identifiers

PMID32060330
PMCPMC7021909

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

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.