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

DOI10.1016/j.chaos.2017.09.010zbMath1380.94153OpenAlexW2755571012MaRDI QIDQ1694101

Ahmad Zareie, Adel Fatemi, Amir Sheikhahmadi

Publication date: 1 February 2018

Published in: Chaos, Solitons and Fractals (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.chaos.2017.09.010

zbMATH Keywords

entropysocial networksinfluential nodesnode centralitynode ranking

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Measures of information, entropy (94A17) Applications of graph theory to circuits and networks (94C15)

Related Items (6)

A generalized gravity model for influential spreaders identification in complex networks ⋮ An effective heuristic clustering algorithm for mining multiple critical nodes in complex networks ⋮ Identification of influential users in social networks based on users' interest ⋮ M-Centrality: identifying key nodes based on global position and local degree variation ⋮ Identifying vital nodes in complex networks based on information entropy, minimum dominating set and distance ⋮ A betweenness structural entropy of complex networks

Cites Work

• Unnamed Item
• Identifying and ranking influential spreaders in complex networks by neighborhood coreness
• Ranking the spreading ability of nodes in complex networks based on local structure
• Identifying influential spreaders by weighted leaderrank
• The centrality index of a graph
• Collective dynamics of ‘small-world’ networks
• Machine Learning: ECML 2004
• Elements of Information Theory
• A Computer Method for Calculating Kendall's Tau with Ungrouped Data
• THE TREATMENT OF TIES IN RANKING PROBLEMS

This page was built for publication: Influential nodes ranking in complex networks: an entropy-based approach