Influential Performance of Nodes Identified by Relative Entropy in Dynamic Networks
For decades, centrality has been one of the most studied concepts in the case of complex networks. It addresses the problem of identification of the most influential nodes in the network. Despite the large number of the proposed methods for measuring centrality, each method takes different character...
Main Authors: | Péter Marjai, Attila Kiss |
---|---|
Format: | Article |
Language: | English |
Published: |
World Scientific Publishing
2021-02-01
|
Series: | Vietnam Journal of Computer Science |
Subjects: | |
Online Access: | http://www.worldscientific.com/doi/epdf/10.1142/S2196888821500032 |
Similar Items
-
Efficiency centrality in time-varying graphs
by: Marjai Péter, et al.
Published: (2020-07-01) -
Influential Nodes Identification in Complex Networks via Information Entropy
by: Chungu Guo, et al.
Published: (2020-02-01) -
How to Identify the Most Powerful Node in Complex Networks? A Novel Entropy Centrality Approach
by: Tong Qiao, et al.
Published: (2017-11-01) -
A Novel Model to Identify the Influential Nodes: Evidence Theory Centrality
by: Jie Zhao, et al.
Published: (2020-01-01) -
A Novel Entropy-Based Centrality Approach for Identifying Vital Nodes in Weighted Networks
by: Tong Qiao, et al.
Published: (2018-04-01)