arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2408.01157cs.SI
收藏

关于从2-core计算介数中心性的注记

A Note on Computing Betweenness Centrality from the 2-core

Charalampos E. Tsourakakis

AI总结:

本文提出从图的2-core递归计算介数中心性的公式,并证明在SSSP枢轴采样中移除一度节点可降低样本复杂度、提升精度并减少运行时间。

摘要:

网络分析中的一个核心任务是识别图中的重要节点。介数中心性(BC)是一种流行的中心性度量,它根据每个节点所经过的最短路径数量来衡量节点的重要性。在本注记中,我们推导出一个递归公式,用于从图的2-core的介数中心性计算该图的介数中心性。此外,我们在流行的单源最短路径(SSSP)计算的枢轴采样方案背景下,从数学上分析了移除一度节点对介数中心性估计的显著影响,该方案在Brandes-Pich方法中有所描述,并在NetworkX等广泛使用的软件中实现。我们从理论和实验两方面证明,移除一度节点可以降低实现更高精度所需的样本复杂度,从而减少总体运行时间。

英文摘要:

A central task in network analysis is to identify important nodes in a graph. Betweenness centrality (BC) is a popular centrality measure that captures the significance of nodes based on the number of shortest paths each node intersects with. In this note, we derive a recursive formula to compute the betweenness centralities of a graph from the betweenness centralities of its 2-core.Furthermore, we analyze mathematically the significant impact of removing degree-one nodes on the estimation of betweenness centrality within the context of the popular pivot sampling scheme for Single-Source Shortest Path (SSSP) computations, as described in the Brandes-Pich approach and implemented in widely used software such as NetworkX. We demonstrate both theoretically and empirically that removing degree-1 nodes can reduce the sample complexity needed to achieve better accuracy, thereby decreasing the overall runtime.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑