arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1102.5511physics.soc-phcs.DScs.SI
收藏

离散核/库划分问题的一种快速算法

A Fast Algorithm for the Discrete Core/Periphery Bipartitioning Problem

Sean Z. W. Lip

摘要:

在文献中已经提出了各种方法来确定网络中的演员集到核心和外围子集的最佳划分。然而,这些方法要么只适用于相对较小的输入大小,要么不能保证最佳答案。在本文中,我们提出了一个新的算法来解决这个问题。该算法是高效和准确的,允许在一秒内计算出数千个参与者的网络的最佳划分。我们还表明,最佳的核心可以被描述为一个集合,包含原网络中度最高的演员。

英文摘要:

Various methods have been proposed in the literature to determine an optimal partitioning of the set of actors in a network into core and periphery subsets. However, these methods either work only for relatively small input sizes, or do not guarantee an optimal answer. In this paper, we propose a new algorithm to solve this problem. This algorithm is efficient and exact, allowing the optimal partitioning for networks of several thousand actors to be computed in under a second. We also show that the optimal core can be characterized as a set containing the actors with the highest degrees in the original network.

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

↑