ComNetX: Local Hierarchical Adaptation for Batched Dynamic Community Detection
Received: 10 Nov 2026 Revised: 11 Nov 2026 Accepted: 11 Nov 2026
Published: 2026, vol. 30, issue 4, pp. 345–348
Abstract
We present ComNetX, an algorithm that adapts static community detection methods to dynamic graphs through local updates of a partition hierarchy. It supports topology-based and neural methods, including those using node features. We establish preservation of hierarchy nesting, conditions for modularity preservation under graph contraction, and time and memory bounds. On five graphs, speedups over repeated Leiden runs range from 6.60 to 98.72, with absolute final modularity differences of 0.0035–0.0213.
Keywords: dynamic graph, community detection, partition hierarchy, modularity.
BibTeX
@article{IS-Bokov-Konovalov-Uporova-Drobyshev-Egorov2026,
author = {Bokov, Grigoriy Vladimirovich and Konovalov, Aleksandr Yurievich and Uporova, Anna and Drobyshev, Alexander Sergeevich and Egorov, Iaroslav},
title = {{ComNetX: Local Hierarchical Adaptation for Batched Dynamic Community Detection}},
journal = {Intelligent Systems. Theory and Applications},
year = {2026},
volume = {30},
number = {4},
pages = {345--348},
}
AMSBIB
\Bibitem{IS-Bokov-Konovalov-Uporova-Drobyshev-Egorov2026}
\by G.\,V.~Bokov, A.\,Y.~Konovalov, A.~Uporova, A.\,S.~Drobyshev, I.~Egorov
\paper ComNetX: Local Hierarchical Adaptation for Batched Dynamic Community Detection
\jour Intelligent Systems. Theory and Applications
\yr 2026
\vol 30
\issue 4
\pages 345--348
\lang In Russian
RU