Transfer operators on graphs: Spectral clustering and beyond

Abstract

Graphs and networks play an important role in modeling and analyzing complex interconnected systems such as transportation networks, integrated circuits, power grids, citation graphs, and biological and artificial neural networks. Graph clustering algorithms can be used to detect groups of strongly connected vertices and to derive coarse-grained models. We define transfer operators such as the Koopman operator and the Perron-Frobenius operator on graphs, study their spectral properties, introduce Galerkin projections of these operators, and illustrate how reduced representations can be estimated from data. In particular, we show that spectral clustering of undirected graphs can be interpreted in terms of eigenfunctions of the Koopman operator and propose novel clustering algorithms for directed graphs based on generalized transfer operators. We demonstrate the efficacy of the resulting algorithms on several benchmark problems and provide different interpretations of clusters.

References in corpus (12)

• Linear predictors for nonlinear dynamical systems: Koopman operator meets model predictive control
• Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities
• Data-driven approximation of the Koopman generator: Model reduction, system identification, and control
• Transport in time-dependent dynamical systems: Finite-time coherent sets
• On the numerical approximation of the Perron-Frobenius and Koopman operator
• An analytic framework for identifying finite-time coherent sets in time-dependent dynamical systems
• Understanding the geometry of transport: diffusion maps for Lagrangian trajectory data unravel coherent sets
• Partitioning Well-Clustered Graphs: Spectral Clustering Works!
• Optimal data-driven estimation of generalized Markov state models for non-equilibrium dynamics
• Kernel methods for detecting coherent structures in dynamical data
• Hermitian matrices for clustering directed graphs: insights and applications
• Koopman-based spectral clustering of directed and time-evolving graphs

Cited by in corpus (2)

• Dynamical systems and complex networks: A Koopman operator perspective
• Clustering Time-Evolving Networks Using the Spatio-Temporal Graph Laplacian