arXivDaily arXiv每日学术速递 周一至周五更新
arXiv physics/0512106physics.soc-phcond-mat.dis-nncond-mat.stat-mech
收藏

使用随机游走计算大型网络中的社区(长版)

Computing communities in large networks using random walks (long version)

Pascal Pons, Matthieu Latapy

摘要:

稀疏图的稠密子图(社区)在现实世界的复杂网络中有着重要的作用。然而,计算它们通常是昂贵的。我们在这里提出了一种基于随机游走的顶点之间的相似性度量,它具有几个重要的优点:它很好地捕捉了网络中的社区结构,它可以有效地计算,并且它可以用于凝聚算法来有效地计算网络的社区结构。我们提出了这样一个算法,称为Walktrap,在最坏的情况下,它在时间O(mn^2)和空间O(n^2)中运行,在大多数真实情况下,时间O(n^2log n)和空间O(n^2)(n和m分别是输入图中的顶点和边的数量)。广泛的比较测试表明,我们的算法超过以前提出的关于所获得的社区结构的质量,它的运行时间是最好的。

英文摘要:

Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expensive. We propose here a measure of similarities between vertices based on random walks which has several important advantages: it captures well the community structure in a network, it can be computed efficiently, and it can be used in an agglomerative algorithm to compute efficiently the community structure of a network. We propose such an algorithm, called Walktrap, which runs in time O(mn^2) and space O(n^2) in the worst case, and in time O(n^2log n) and space O(n^2) in most real-world cases (n and m are respectively the number of vertices and edges in the input graph). Extensive comparison tests show that our algorithm surpasses previously proposed ones concerning the quality of the obtained community structures and that it stands among the best ones concerning the running time.

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

↑