Influential nodes ranking in complex networks: An entropy-based approach

Ahmad Zareie, Amir Sheikhahmadi and Adel Fatemi

Chaos, Solitons & Fractals, 2017, vol. 104, issue C, 485-494

Abstract: Measurement of the spreading capability of nodes has been one of the most attractive challenges in the field of social networks. Because of the huge number of nodes in a network, it has appealed to many researchers to find an accurate measure which can potentially detect the spreading capability and rankings of nodes. Most of the available methods determine the spreading capability of nodes based on their topological locations. In this paper, however, we have proposed a new measure based on the basic notions in information theory to detect the spreading capability of nodes in networks on the basis of their topological information. The simulation and experimental results of investigating real-world and artificial networks show that the proposed measure is more accurate and efficient than the similar ones.

Keywords: Social networks; Influential nodes; Entropy; Node centrality; Node ranking (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (12)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077917303788
Full text for ScienceDirect subscribers only

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:eee:chsofr:v:104:y:2017:i:c:p:485-494

DOI: 10.1016/j.chaos.2017.09.010

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().