Spectral clustering of time-evolving networks using the inflated dynamic Laplacian for graphs
<|reference_start|>Spectral clustering of time-evolving networks using the inflated dynamic Laplacian for graphs: Complex time-varying networks are prominent models for a wide variety of spatiotemporal phenomena. The functioning of networks depends crucially on their connectivity, yet reliable techniques for determining communities in spacetime networks remain elusive. We adapt successful spectral techniques from continuous-time dynamics on manifolds to the graph setting to fill this gap. We formulate an inflated dynamic Laplacian for graphs and develop a spectral theory to underpin the corresponding algorithmic realisations. We develop spectral clustering approaches for both multiplex and non-multiplex networks, based on the eigenvectors of the inflated dynamic Laplacian and specialised Sparse EigenBasis Approximation (SEBA) post-processing of these eigenvectors. We demonstrate that our approach can outperform the Leiden algorithm applied both in spacetime and layer-by-layer, and we analyse voting data from the US senate (where senators come and go as congresses evolve) to quantify increasing polarisation in time.<|reference_end|>
@article{froyland2024spectral,
    title={Spectral clustering of time-evolving networks using the inflated dynamic
  Laplacian for graphs},
    author={Gary Froyland, Manu Kalia, P'eter Koltai},
    journal={arXiv preprint arXiv:2409.11984},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.11984},
    primaryClass={cs.SI math.DS physics.soc-ph}
}