Koopman-based spectral clustering of directed and time-evolving graphs

by   Stefan Klus, et al.

While spectral clustering algorithms for undirected graphs are well established and have been successfully applied to unsupervised machine learning problems ranging from image segmentation and genome sequencing to signal processing and social network analysis, clustering directed graphs remains notoriously difficult. Two of the main challenges are that the eigenvalues and eigenvectors of graph Laplacians associated with directed graphs are in general complex-valued and that there is no universally accepted definition of clusters in directed graphs. We first exploit relationships between the graph Laplacian and transfer operators and in particular between clusters in undirected graphs and metastable sets in stochastic dynamical systems and then use a generalization of the notion of metastability to derive clustering algorithms for directed and time-evolving graphs. The resulting clusters can be interpreted as coherent sets, which play an important role in the analysis of transport and mixing processes in fluid flows.


Transfer operators on graphs: Spectral clustering and beyond

Graphs and networks play an important role in modeling and analyzing com...

Spectral clustering algorithms for the detection of clusters in block-cyclic and block-acyclic graphs

We propose two spectral algorithms for partitioning nodes in directed gr...

Higher-Order Spectral Clustering of Directed Graphs

Clustering is an important topic in algorithms, and has a number of appl...

Hermitian matrices for clustering directed graphs: insights and applications

Graph clustering is a basic technique in machine learning, and has wides...

Regularity based spectral clustering and mapping the Fiedler-carpet

Spectral clustering is discussed from many perspectives, by extending it...

Stochastic Parallelizable Eigengap Dilation for Large Graph Clustering

Large graphs commonly appear in social networks, knowledge graphs, recom...

Digenes: genetic algorithms to discover conjectures about directed and undirected graphs

We present Digenes, a new discovery system that aims to help researchers...

Please sign up or login with your details

Forgot password? Click here to reset