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

DOI10.1016/J.CHAOS.2017.09.010MaRDI QIDQ1694101zbMATH OpenOpenAlexFDO

Authors Ahmad Zareie, Amir Sheikhahmadi, Adel Fatemi

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

entropyinfluential nodesnode centralitynode rankingsocial networks

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)

Recommendations

• A new local and multidimensional ranking measure to detect spreaders in social networks
• Identifying and ranking influential spreaders in complex networks by neighborhood coreness
• A new method for identifying influential nodes and important edges in complex networks
• A new measure of identifying influential nodes: efficiency centrality
• Identifying influential spreaders by weight degree centrality in complex networks

Cites work

• A Computer Method for Calculating Kendall's Tau with Ungrouped Data
• Collective dynamics of `small-world' networks
• Elements of Information Theory
• scientific article; zbMATH DE number 1303610 (Why is no real title available?)
• Identifying and ranking influential spreaders in complex networks by neighborhood coreness
• Identifying influential spreaders by weighted leaderrank
• Machine Learning: ECML 2004
• Ranking the spreading ability of nodes in complex networks based on local structure
• The centrality index of a graph
• THE TREATMENT OF TIES IN RANKING PROBLEMS

Cited in

(12)

• Ranking the spreading influence of nodes in complex networks: an extended weighted degree centrality based on a remaining minimum degree decomposition
• Tackling information asymmetry in networks: a new entropy-based ranking index
• A betweenness structural entropy of complex networks
• A generalized gravity model for influential spreaders identification in complex networks
• Identification of influential users in social networks based on users' interest
• An effective heuristic clustering algorithm for mining multiple critical nodes in complex networks
• M-centrality: identifying key nodes based on global position and local degree variation
• scientific article; zbMATH DE number 7338857 (Why is no real title available?)
• Identifying vital nodes in complex networks based on information entropy, minimum dominating set and distance
• Rank the spreading influence of nodes using dynamic Markov process
• Ranking edges by their impact on the spectral complexity of information diffusion over networks
• Topological complexity quantification in hypergraphs networks via hyperedge-based entropic measures

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1694101)