Co-clustering directed graphs to discover asymmetries and directional communities

• Published in: Proceedings of the National Academy of Sciences - PNAS Vol. 113; no. 45; pp. 12679 - 12684
• Main Authors: Rohe, Karl, Qin, Tai, Yu, Bin
• Format: Journal Article
• Language: English
• Published: United States National Academy of Sciences 08.11.2016
• Subjects: Algorithms; Asymmetry; Graph theory; Nematodes; Physical Sciences; Statistics; Stochastic models; SVD; Stochastic Blockmodel; spectral clustering
• ISSN: 0027-8424; 1091-6490; 1091-6490
• DOI: 10.1073/pnas.1525793113

In directed graphs, relationships are asymmetric and these asymmetries contain essential structural information about the graph. Directed relationships lead to a new type of clustering that is not feasible in undirected graphs. We propose a spectral co-clustering algorithm called DI-SIM for asymmetry discovery and directional clustering. A Stochastic co-Blockmodel is introduced to show favorable properties of DI-SIM. To account for the sparse and highly heterogeneous nature of directed networks, DI-SIM uses the regularized graph Laplacian and projects the rows of the eigenvector matrix onto the sphere. A nodewise ASYMMETRY SCORE and DI-SIM are used to analyze the clustering asymmetries in the networks of Enron emails, political blogs, and the Caenorhabditis elegans chemical connectome. In each example, a subset of nodes have clustering asymmetries; these nodes send edges to one cluster, but receive edges from another cluster. Such nodes yield insightful information (e.g., communication bottlenecks) about directed networks, but are missed if the analysis ignores edge direction.