...
【24h】

On Decay Centrality

机译:衰变中心

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

We establish a relationship between decay centrality and two widely used measures of centrality, namely degree and closeness. We show that for low values of the decay parameter the nodes with maximum decay centrality also have maximum degree, whereas for high values of the decay parameter they also maximize closeness. For intermediate values, we provide sufficient conditions that allow the comparison of decay centrality of different nodes and we show via numerical simulations that in the vast majority of networks, the nodes with maximum decay centrality are characterized by a threshold on the decay parameter below which they belong to the set of nodes with maximum degree and above which they belong to the set of nodes with maximum closeness. We also propose a simple rule of thumb that ensures a nearly optimal choice with very high probability.
机译:我们建立了衰减中心性和两个广泛使用的中心性度量之间的关系,即度和紧密度。我们表明,对于低的衰减参数值,具有最大衰减中心度的节点也具有最大程度,而对于高的衰减参数值,它们也使紧密度最大化。对于中间值,我们提供了足以比较不同节点的衰减中心的条件,并且通过数值模拟显示,在绝大多数网络中,具有最大衰减中心的节点的特征在于衰减参数的阈值,低于该阈值它们属于最大度数的节点集,高于该度数的节点属于最大亲和度的节点集。我们还提出了一条简单的经验法则,可以确保以极高的概率实现接近最佳的选择。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号