An iterative spectral algorithm for digraph clustering

Abstract

Graph clustering is a fundamental technique in data analysis with applications in many different fields. While there is a large body of work on clustering undirected graphs, the problem of clustering directed graphs is much less understood. The analysis is more complex in the directed graph case for two reasons: the clustering must preserve directional information in the relationships between clusters, and directed graphs have non-Hermitian adjacency matrices whose properties are less conducive to traditional spectral methods. Here, we consider the problem of partitioning the vertex set of a directed graph into k≥2 clusters so that edges between different clusters tend to follow the same direction. We present an iterative algorithm based on spectral methods applied to new Hermitian representations of directed graphs. Our algorithm performs favourably against the state-of-the-art, both on synthetic and real-world data sets. Additionally, it can identify a ‘meta-graph’ of k vertices that represents the higher-order relations between clusters in a directed graph. We showcase this capability on data sets about food webs, biological neural networks, and the online card game Hearthstone.