Clustering time-evolving networks using the spatiotemporal graph Laplacian

Time-evolving graphs arise frequently when modeling complex dynamical systems such as social networks, traffic flow, and biological processes. Developing techniques to identify and analyze communities in these time-varying graph structures is an important challenge. In this work, we generalize existing spectral clustering algorithms from static to dynamic graphs using canonical correlation analysis to capture the temporal evolution of clusters. Based on this extended canonical correlation framework, we define the spatiotemporal graph Laplacian and investigate its spectral properties. We connect these concepts to dynamical systems theory via transfer operators and illustrate the advantages of our method on benchmark graphs by comparison with existing methods. We show that the spatiotemporal graph Laplacian allows for a clear interpretation of cluster structure evolution over time for directed and undirected graphs.