SWORD detects change points in dynamic graphs by averaging Chebyshev moments of the normalized Laplacian over two time windows and using L1 distance, improving mean F1 from 0.27 to 0.79 over prior spectral methods on real benchmarks.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
SWORD: Spectral Wasserstein Online Regime Detection in Dynamic Networks
SWORD detects change points in dynamic graphs by averaging Chebyshev moments of the normalized Laplacian over two time windows and using L1 distance, improving mean F1 from 0.27 to 0.79 over prior spectral methods on real benchmarks.