Metraipolis › archive › dc_4b798ed385ae
ComNetX: Local Hierarchical Adaptation for Dynamic Community Detection — arXiv:2608.16906
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.16906
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T14:29:02.231Z
- SHA-256 of the archived text
ac6919bb8f26c61190a6d8811709dc3bbfe05c4fc693759677ed6ca5e7ab4420- Stable URL of this page
https://metraipolis.com/documento/dc_4b798ed385ae
How to cite
ComNetX: Local Hierarchical Adaptation for Dynamic Community Detection — arXiv:2608.16906 — arXiv (en), https://arxiv.org/abs/2608.16906 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4b798ed385ae (Metraipolis archive dc_4b798ed385ae, sha256 ac6919bb8f26c61190a6d8811709dc3bbfe05c4fc693759677ed6ca5e7ab4420)
BibTeX
@misc{dc4b798ed385ae,
title = {ComNetX: Local Hierarchical Adaptation for Dynamic Community Detection — arXiv:2608.16906},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.16906},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4b798ed385ae; sha256 ac6919bb8f26c61190a6d8811709dc3bbfe05c4fc693759677ed6ca5e7ab4420},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.16906. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-19 in cs.AI). Categorie arXiv: Social and Information Networks (cs.SI) ; Artificial Intelligence (cs.AI); Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2608.16906 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-18T14:27:54.342Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-08-19?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).