arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1704.01077cs.DS
收藏

在无权图中快速计算top-k贴近中心性

Computing top-k Closeness Centrality Faster in Unweighted Graphs

Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke

摘要:

给定一个连通图$G=(V,E)$,顶点$v$的贴近中心度定义为$\frac{n-1}{\sum_{w \in V} d(v,w)}$。该测度在现实世界的复杂网络分析中得到了广泛的应用,而$k$最中心点的选择问题在过去的十年中得到了深入的分析。然而,这个问题在计算上是不容易的,特别是对于大型网络:在本文的第一部分中,我们证明了它是不可解的时间$Ø(|E|^{2-ε})$有向图,任何常数$ε>0$,在合理的复杂性假设。此外,我们提出了一个新的算法来选择$k$最中心的节点在一个图中:我们的实验表明,该算法显着提高了教科书的算法,这是基于计算之间的距离的所有对顶点,和最先进的。例如,我们能够计算顶部$k$节点在几十秒内在现实世界中的网络与数百万的节点和边缘。最后,作为一个案例研究,我们计算$10$最核心的演员在IMDB的合作网络,其中两个演员是链接的,如果他们一起在一部电影中,并在维基百科的引文网络,其中包含一个有向边缘从一个页面$p$到一个页面$q$,如果$p$包含一个链接到$q$。

英文摘要:

Given a connected graph $G=(V,E)$, the closeness centrality of a vertex $v$ is defined as $\frac{n-1}{\sum_{w \in V} d(v,w)}$. This measure is widely used in the analysis of real-world complex networks, and the problem of selecting the $k$ most central vertices has been deeply analysed in the last decade. However, this problem is computationally not easy, especially for large networks: in the first part of the paper, we prove that it is not solvable in time $Ø(|E|^{2-ε})$ on directed graphs, for any constant $ε>0$, under reasonable complexity assumptions. Furthermore, we propose a new algorithm for selecting the $k$ most central nodes in a graph: we experimentally show that this algorithm improves significantly both the textbook algorithm, which is based on computing the distance between all pairs of vertices, and the state of the art. For example, we are able to compute the top $k$ nodes in few dozens of seconds in real-world networks with millions of nodes and edges. Finally, as a case study, we compute the $10$ most central actors in the IMDB collaboration network, where two actors are linked if they played together in a movie, and in the Wikipedia citation network, which contains a directed edge from a page $p$ to a page $q$ if $p$ contains a link to $q$.

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

↑