arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2601.08554cs.SIcs.DBcs.GR
收藏

维护大规模动态图中的 Leiden 社区

Maintaining Leiden Communities in Large Dynamic Graphs

ByteDance Inc.(字节跳动)

Chunxu Lin, Yumao Xie, Yixiang Fang, Yongmin Hu, Yingqian Hu, Cheng Chen

AI总结:

针对现有动态 Leiden 算法在频繁更新下效率低的问题,提出 HIT-Leiden 算法,通过维护连通分量和层次社区结构减少受影响顶点范围,实现高达五个数量级的加速。

摘要:

社区检测是大规模工业图分析中的基础能力,支撑着欺诈团伙发现、推荐系统和检索增强生成的层次索引等应用。在基于模块度的方法中,Leiden 算法因其能生成具有连通性保证的高质量社区而被广泛采用。然而,现实世界的图不断演化,需要及时更新社区以保持下游特征和检索索引的新鲜度。同时,现有的动态 Leiden 方法在顶点和边发生变化时重新计算社区,因此在频繁更新下几乎退化为接近完全重新计算。为了解决效率问题,我们研究了大规模动态图中 Leiden 社区的高效维护,并提出了一种新颖算法,称为层次增量树 Leiden(HIT-Leiden)。我们首先进行了有界性分析,表明先前的增量 Leiden 方法即使对于小更新也可能产生本质上无界的工作量。在此分析的指导下,我们提出了 HIT-Leiden,它通过维护连通分量和层次社区结构有效减少了受影响顶点的范围。在大型真实动态图上的大量实验表明,HIT-Leiden 实现了与最先进竞争对手相当的社区质量,同时相比现有解决方案实现了高达五个数量级的加速。生产部署结果表明,HIT-Leiden 在高频更新下满足严格的延迟要求。

英文摘要:

Community detection is a foundational capability in large-scale industrial graph analytics, powering applications such as fraud-ring discovery, recommendation systems, and hierarchical indexing for retrieval-augmented generation. Among modularity-based methods, the Leiden algorithm has been widely adopted in production because it delivers high-quality communities with connectivity guarantees. However, real-world graphs evolve continuously, and timely community updates are needed to keep downstream features and retrieval indices fresh. Meanwhile, existing dynamic Leiden approaches recompute the communities whenever their vertices and edges change, thereby almost degrading to near-full recomputation under frequent updates. To alleviate the efficiency issue, we study the efficient maintenance of Leiden communities in large dynamic graphs and present a novel algorithm, called Hierarchical Incremental Tree Leiden (HIT-Leiden). We first provide a boundedness analysis showing that prior incremental Leiden methods can incur essentially unbounded work even for small updates. Guided by this analysis, we propose HIT-Leiden which effectively reduces the range of affected vertices by maintaining connected components and hierarchical community structures. Extensive experiments on large real-world dynamic graphs demonstrate that HIT-Leiden achieves community quality comparable to the state-of-the-art competitors while delivering speedups of up to five orders of magnitude over existing solutions. The production deployment results show that HIT-Leiden meets stringent latency requirements under high-rate updates at scale.

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

↑