Hermitian matrices for clustering directed graphs: insights and applications

by   Mihai Cucuringu, et al.

Graph clustering is a basic technique in machine learning, and has widespread applications in different domains. While spectral techniques have been successfully applied for clustering undirected graphs, the performance of spectral clustering algorithms for directed graphs (digraphs) is not in general satisfactory: these algorithms usually require symmetrising the matrix representing a digraph, and typical objective functions for undirected graph clustering do not capture cluster-structures in which the information given by the direction of the edges is crucial. To overcome these downsides, we propose a spectral clustering algorithm based on a complex-valued matrix representation of digraphs. We analyse its theoretical performance on a Stochastic Block Model for digraphs in which the cluster-structure is given not only by variations in edge densities, but also by the direction of the edges. The significance of our work is highlighted on a data set pertaining to internal migration in the United States: while previous spectral clustering algorithms for digraphs can only reveal that people are more likely to move between counties that are geographically close, our approach is able to cluster together counties with a similar socio-economical profile even when they are geographically distant, and illustrates how people tend to move from rural to more urbanised areas.


page 9

page 16

page 19


Generalized Spectral Clustering for Directed and Undirected Graphs

Spectral clustering is a popular approach for clustering undirected grap...

Skew-Symmetric Adjacency Matrices for Clustering Directed Graphs

Cut-based directed graph (digraph) clustering often focuses on finding d...

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

While spectral clustering algorithms for undirected graphs are well esta...

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...

Transfer operators on graphs: Spectral clustering and beyond

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

Co-clustering for directed graphs: the Stochastic co-Blockmodel and spectral algorithm Di-Sim

Directed graphs have asymmetric connections, yet the current graph clust...

Please sign up or login with your details

Forgot password? Click here to reset