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.
Advancing Community Detection with Graph Convolutional Neural Networks: Bridging Topological and Attributive Cohesion
Victoria University of Wellington(维多利亚大学);Goldenset Collective(Goldenset集体);School of Computer Science, Beijing University of Posts and Telecommunications(北京邮电大学计算机学院)
Heuristic and exact modularity optimization with size-constrained communities
Kellogg School of Management, Northwestern University(西北大学凯洛格管理学院);Department of Mechanical and Industrial Engineering, University of Toronto(多伦多大学机械与工业工程系);Centre for Science and Technology Studies (CWTS), Leiden University(莱顿大学科学技术研究中心);Center for Complex Networks and Systems Research, Luddy School of Informatics, Computing, and Engineering, Indiana University Bloomington(印第安纳大学布鲁明顿分校卢迪信息、计算与工程学院复杂网络与系统研究中心)
Modularity maximization and community detection in complex networks through recursive and hierarchical annealing in the D-Wave Advantage quantum processing units
Sano Centre for Computational Medicine(Sano计算医学中心);AGH University of Krakow, Faculty of Computer Science(克拉科夫AGH科技大学计算机学院);Academic Computer Center Cyfronet AGH(AGH学术计算中心Cyfronet)
A Noise-Resilient Semi-Supervised Graph Autoencoder for Overlapping Semantic Community Detection
Laboratoire des Mathématiques et Sciences Appliquées (LMSA), Université de Ghardaia(应用数学和科学实验室(LMSA),加兹达亚大学);Faculty of Sciences and Technology, Université de Ghardaia(科学与技术学院,加兹达亚大学)