...
首页> 外文期刊>Entropy >How to Identify the Most Powerful Node in Complex Networks? A Novel Entropy Centrality Approach
【24h】

How to Identify the Most Powerful Node in Complex Networks? A Novel Entropy Centrality Approach

机译:如何识别复杂网络中最强大的节点?一种新颖的熵中心性方法

获取原文
           

摘要

Centrality is one of the most studied concepts in network analysis. Despite an abundance of methods for measuring centrality in social networks has been proposed, each approach exclusively characterizes limited parts of what it implies for an actor to be ?¢????vital?¢???? to the network. In this paper, a novel mechanism is proposed to quantitatively measure centrality using the re-defined entropy centrality model, which is based on decompositions of a graph into subgraphs and analysis on the entropy of neighbor nodes. By design, the re-defined entropy centrality which describes associations among node pairs and captures the process of influence propagation can be interpreted explained as a measure of actor potential for communication activity. We evaluate the efficiency of the proposed model by using four real-world datasets with varied sizes and densities and three artificial networks constructed by models including Barabasi-Albert, Erdos-Renyi and Watts-Stroggatz. The four datasets are Zachary?¢????s karate club, USAir97, Collaboration network and Email network URV respectively. Extensive experimental results prove the effectiveness of the proposed method.
机译:集中性是网络分析中研究最多的概念之一。尽管已经提出了许多用于测量社交网络中的中心性的方法,但是每种方法都仅对演员的“重要”意义进行了部分限定。到网络。在本文中,提出了一种新的机制来使用重新定义的熵中心性模型定量地测量中心性,该模型基于将图分解为子图并分析相邻节点的熵。通过设计,可以将解释节点对之间的关​​联并捕获影响传播过程的重新定义的熵中心性解释为一种衡量参与者进行交流活动的潜力的方法。我们通过使用四个具有可变大小和密度的真实世界数据集以及由Barabasi-Albert,Erdos-Renyi和Watts-Stroggatz等模型构建的三个人工网络来评估所提出模型的效率。这四个数据集分别是Zachary的空手道俱乐部,USAir97,协作网络和电子邮件网络URV。大量的实验结果证明了该方法的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号