首页> 美国卫生研究院文献>Entropy >A Novel Method to Rank Influential Nodes in Complex Networks Based on Tsallis Entropy
【2h】

A Novel Method to Rank Influential Nodes in Complex Networks Based on Tsallis Entropy

机译:基于TSAllis熵的复杂网络中影响有影响力节点的新方法

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

With the rapid development of social networks, it has become extremely important to evaluate the propagation capabilities of the nodes in a network. Related research has wide applications, such as in network monitoring and rumor control. However, the current research on the propagation ability of network nodes is mostly based on the analysis of the degree of nodes. The method is simple, but the effectiveness needs to be improved. Based on this problem, this paper proposes a method that is based on Tsallis entropy to detect the propagation ability of network nodes. This method comprehensively considers the relationship between a node’s Tsallis entropy and its neighbors, employs the Tsallis entropy method to construct the TsallisRank algorithm, and uses the SIR (Susceptible, Infectious, Recovered) model for verifying the correctness of the algorithm. The experimental results show that, in a real network, this method can effectively and accurately evaluate the propagation ability of network nodes.
机译:随着社交网络的快速发展,评估网络中节点的传播能力变得非常重要。相关研究具有广泛的应用,例如网络监控和谣言控制。但是,目前对网络节点传播能力的研究主要基于对节点程度的分析。该方法简单,但需要提高有效性。基于此问题,本文提出了一种基于TSAllis熵的方法来检测网络节点的传播能力。该方法全面考虑节点TSAllis熵和其邻居之间的关系,采用TSallis熵方法来构建TSallisRank算法,并使用SIR(易感,感染,恢复的)模型来验证算法的正确性。实验结果表明,在真实网络中,这种方法可以有效准确地评估网络节点的传播能力。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号