arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0709.3420cs.NIphysics.soc-ph
收藏

共介性:中心性的两两概念

Co-Betweenness: A Pairwise Notion of Centrality

Eric D. Kolaczyk, David B. Chua, Marc Barthelemy

摘要:

介数中心性是一种度量,它试图量化网络图中顶点对整个网络中测地路径上信息分布的“控制”方面的重要性。然而,该量并不捕获不同顶点如何一起参与这种控制。为了允许在这方面的更精细的细节的揭露,我们在这里介绍了一个扩展的介数中心对顶点,我们的术语co-betweenness,提供了量化的基础上各种类似的成对概念的重要性和控制。更具体地说,我们激励和定义一个精确的概念的co-betweenness,我们提出了一个有效的算法,其计算,扩展算法的Brandes在一个自然的方式,我们说明了利用这种co-betweenness在少数几个不同的通信网络。从这些现实世界的例子中,我们表明,co-betweenness允许一个确定某些顶点,这些顶点不是最中心的顶点,但尽管如此,作为重要的演员在网络中的信息的中继和调度。

英文摘要:

Betweenness centrality is a metric that seeks to quantify a sense of the importance of a vertex in a network graph in terms of its "control" on the distribution of information along geodesic paths throughout that network. This quantity however does not capture how different vertices participate together in such control. In order to allow for the uncovering of finer details in this regard, we introduce here an extension of betweenness centrality to pairs of vertices, which we term co-betweenness, that provides the basis for quantifying various analogous pairwise notions of importance and control. More specifically, we motivate and define a precise notion of co-betweenness, we present an efficient algorithm for its computation, extending the algorithm of Brandes in a natural manner, and we illustrate the utilization of this co-betweenness on a handful of different communication networks. From these real-world examples, we show that the co-betweenness allows one to identify certain vertices which are not the most central vertices but which, nevertheless, act as important actors in the relaying and dispatching of information in the network.

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

↑