LD-Leiden: Local Parallel Community Detection in Dynamic Graphs
Received: 08 Nov 2026 Revised: 09 Nov 2026 Accepted: 10 Nov 2026
Published: 2026, vol. 30, issue 4, pp. 148–151
Abstract
LD-Leiden locally updates the Leiden hierarchy and coordinates parallel vertex moves in dynamic weighted graphs. On nine real-world graphs (up to 50.9M vertices and 117M edges), geometric-mean speedup over repeated Leiden is 25.64, with a mean final modularity ratio of 0.996. On graphs up to 214M vertices and 3.30B edges, scaling from 1 to 64 threads gives a mean speedup of 5.22.
Keywords: dynamic graph, community detection, modularity, Leiden.
BibTeX
@article{IS-Bokov-Konovalov-Uporova-Moiseev-Safonov-Radionov2026,
author = {Bokov, Grigoriy Vladimirovich and Konovalov, Aleksandr Yurievich and Uporova, Anna and Moiseev, Stanislav and Safonov, Ivan and Radionov, Alexander},
title = {{LD-Leiden: Local Parallel Community Detection in Dynamic Graphs}},
journal = {Intelligent Systems. Theory and Applications},
year = {2026},
volume = {30},
number = {4},
pages = {148--151},
}
AMSBIB
\Bibitem{IS-Bokov-Konovalov-Uporova-Moiseev-Safonov-Radionov2026}
\by G.\,V.~Bokov, A.\,Y.~Konovalov, A.~Uporova, S.~Moiseev, I.~Safonov, A.~Radionov
\paper LD-Leiden: Local Parallel Community Detection in Dynamic Graphs
\jour Intelligent Systems. Theory and Applications
\yr 2026
\vol 30
\issue 4
\pages 148--151
\lang In Russian
Published under
Creative Commons Attribution 4.0 International (CC BY 4.0)
RU