arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2409.06994cs.SIstat.CO
收藏

大型网络中分治算法的图子采样

Graph sub-sampling for divide-and-conquer algorithms in large networks

Eric Yanchenko

AI总结:

本研究比较了七种图子采样算法在社区结构和核心-边缘结构分治算法中的表现,发现最佳子采样方法因任务而异,强调了针对特定应用选择子采样例程的重要性。

摘要:

随着网络规模持续增长,当前方法必须能够处理大量节点和边才能具有实际相关性。分析子网络已成为一种流行的方法,而非直接处理整个(大型)网络。然而,由于网络固有的互联性,子采样并非一项简单的任务。尽管该问题近年来受到关注,但尚未引起统计学界的足够重视。在本研究中,我们通过对七种图子采样算法应用于社区结构和核心-边缘(CP)结构的分治算法进行彻底比较。在讨论了各种算法和子采样例程之后,我们推导了在各种子采样方案下,CP结构分治算法的误分类率的理论结果。然后,我们在模拟和真实世界数据上进行了广泛实验,以比较各种方法。对于社区检测任务,我们发现随机均匀采样节点产生最佳性能,但有时应用于整个网络的基础算法在识别和计算时间方面均产生更好的结果。另一方面,对于CP结构,没有单一的赢家,但以更高比率采样核心节点的算法始终优于其他采样例程,例如随机边采样和随机游走采样。与社区检测不同,CP分治算法倾向于产生更好的识别结果,同时也比基础算法更快。采样算法在不同任务上的不同表现表明,为特定应用仔细选择子采样例程的重要性。

英文摘要:

As networks continue to increase in size, current methods must be capable of handling large numbers of nodes and edges in order to be practically relevant. Instead of working directly with the entire (large) network, analyzing sub-networks has become a popular approach. Due to a network's inherent inter-connectedness, however, sub-sampling is not a trivial task. While this problem has gained popularity in recent years, it has not received sufficient attention from the statistics community. In this work, we provide a thorough comparison of seven graph sub-sampling algorithms by applying them to divide-and-conquer algorithms for community structure and core-periphery (CP) structure. After discussing the various algorithms and sub-sampling routines, we derive theoretical results for the mis-classification rate of the divide-and-conquer algorithm for CP structure under various sub-sampling schemes. We then perform extensive experiments on both simulated and real-world data to compare the various methods. For the community detection task, we found that sampling nodes uniformly at random yields the best performance, but that sometimes the base algorithm applied to the entire network yields better results both in terms of identification and computational time. For CP structure on the other hand, there was no single winner, but algorithms which sampled core nodes at a higher rate consistently outperformed other sampling routines, e.g., random edge sampling and random walk sampling. Unlike community detection, the CP divide-and-conquer algorithm tends to yield better identification results while also being faster than the base algorithm. The varying performance of the sampling algorithms on different tasks demonstrates the importance of carefully selecting a sub-sampling routine for the specific application.

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

↑