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

by   H. Van Lierde, et al.
City University of Hong Kong
Université catholique de Louvain

We propose two spectral algorithms for partitioning nodes in directed graphs respectively with a cyclic and an acyclic pattern of connection between groups of nodes. Our methods are based on the computation of extremal eigenvalues of the transition matrix associated to the directed graph. The two algorithms outperform state-of-the art methods for directed graph clustering on synthetic datasets, including methods based on blockmodels, bibliometric symmetrization and random walks. Our algorithms have the same space complexity as classical spectral clustering algorithms for undirected graphs and their time complexity is also linear in the number of edges in the graph. One of our methods is applied to a trophic network based on predator-prey relationships. It successfully extracts common categories of preys and predators encountered in food chains. The same method is also applied to highlight the hierarchical structure of a worldwide network of Autonomous Systems depicting business agreements between Internet Service Providers.


page 1

page 2

page 3

page 4


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

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

Generalized Spectral Clustering for Directed and Undirected Graphs

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

Hermitian matrices for clustering directed graphs: insights and applications

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

Randomized spectral co-clustering for large-scale directed networks

Directed networks are generally used to represent asymmetric relationshi...

Transfer operators on graphs: Spectral clustering and beyond

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

Spectral Clustering of Signed Graphs via Matrix Power Means

Signed graphs encode positive (attractive) and negative (repulsive) rela...

Higher-Order Spectral Clustering of Directed Graphs

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

Please sign up or login with your details

Forgot password? Click here to reset