aiqbench analysis
ComNetX introduces a solver-agnostic framework that accelerates dynamic community detection by hierarchically adapting computations only within affected graph regions rather than reprocessing entire snapshots. This approach successfully bridges the gap between static modularity heuristics and feature-based models, offering significant speedups on large networks without sacrificing solution quality. The method provides a practical pathway for scaling graph analytics in real-time streaming environments where full recomputation is computationally prohibitive.
ComNetX: Local Hierarchical Adaptation for Dynamic Community Detection
arXiv:2608.16906v1 Announce Type: cross Abstract: Dynamic community detection is commonly addressed either by full-snapshot recomputation or by solver-specific dynamic procedures. Full recomputation preserves the semantics of mature static solvers, but it repeatedly processes unchanged graph regions when updates are small. Solver-specific dynamic methods can reduce this cost, but their update rules often have limited transferability across objectives, feature representations, and implementations. In addition, localizing computation only by graph distance may omit community context needed by high-quality solvers. We introduce ComNetX, a solver-agnostic hierarchical adaptation framework for local dynamic updates. ComNetX maintains a multi-level community state, expands the updated region, closes it over affected communities, and contracts these communities into compact local instances. This affected-community closure and contraction preserve solver context while restricting computation to the changed part of the graph. The same interface can wrap modularity heuristics, graph-clustering models that use node features, and native dynamic solvers as local backends. We evaluate ComNetX through a multi-backend study on six real networks, longer real-data streams for topology-based backends, and controlled dynamic stochastic block model stress streams. The results show that ComNetX can preserve the quality of strong modularity-based solvers while reducing update time on large graphs: in paired runs on the largest real graph, Local Leiden keeps final modularity within 0.006 of full-snapshot recomputation while achieving a 41.9 +/- 0.2x speedup. The combined protocols also identify regimes where locality breaks down and a full refresh is preferable.
Abstract:Dynamic community detection is commonly addressed either by full-snapshot recomputation or by solver-specific dynamic procedures. Full recomputation preserves the semantics of mature static solvers, but it repeatedly processes unchanged graph regions when updates are small. Solver-specific dynamic methods can reduce this cost, but their update rules often have limited transferability across objectives, feature representations, and implementations. In addition, localizing computation only by graph distance may omit community context needed by high-quality solvers. We introduce ComNetX, a solver-agnostic hierarchical adaptation framework for local dynamic updates. ComNetX maintains a multi-level community state, expands the updated region, closes it over affected communities, and contracts these communities into compact local instances. This affected-community closure and contraction preserve solver context while restricting computation to the changed part of the graph. The same interface can wrap modularity heuristics, graph-clustering models that use node features, and native dynamic solvers as local backends. We evaluate ComNetX through a multi-backend study on six real networks, longer real-data streams for topology-based backends, and controlled dynamic stochastic block model stress streams. The results show that ComNetX can preserve the quality of strong modularity-based solvers while reducing update time on large graphs: in paired runs on the largest real graph, Local Leiden keeps final modularity within 0.006 of full-snapshot recomputation while achieving a 41.9 +/- 0.2x speedup. The combined protocols also identify regimes where locality breaks down and a full refresh is preferable.
Social and Information Networks (cs.SI); Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
H.2.8; G.2.2; I.5.3
arXiv:2608.16906 [cs.SI]
(or arXiv:2608.16906v1 [cs.SI] for this version)
https://doi.org/10.48550/arXiv.2608.16906 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 334 words
Related coverage
Cost-Aware Hierarchical Multi-Agent Ransomware Detection and Family Attribution
arXiv · Sep 7, 2026
GLAD: Global-Local Adaptive Detector for Robust Speech Deepfake Detection
arXiv · Sep 29, 2026
Cooperative Multi-UAV Navigation in Complex Environments via Systematic Multi-Agent Deep Reinforcement Learning
arXiv · Jul 29, 2026

PIRAMID: Progress and Plans
LessWrong · Jul 27, 2026