Heatmap centrality: A new measure to identify super-spreader nodes in scale-free networks

Christina Durón

PLOS ONE, 2020, vol. 15, issue 7, 1-31

Abstract: The identification of potential super-spreader nodes within a network is a critical part of the study and analysis of real-world networks. Motivated by a new interpretation of the “shortest path” between two nodes, this paper explores the properties of the heatmap centrality by comparing the farness of a node with the average sum of farness of its adjacent nodes in order to identify influential nodes within the network. As many real-world networks are often claimed to be scale-free, numerical experiments based upon both simulated and real-world undirected and unweighted scale-free networks are used to illustrate the effectiveness of the proposed “shortest path” based measure with regards to its CPU run time and ranking of influential nodes.

Date: 2020
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0235690 (text/html)
https://journals.plos.org/plosone/article/file?id= ... 35690&type=printable (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:plo:pone00:0235690

DOI: 10.1371/journal.pone.0235690

Access Statistics for this article

More articles in PLOS ONE from Public Library of Science
Bibliographic data for series maintained by plosone ().