Spectral Theory of Unsigned and Signed Graphs. Applications to Graph Clustering: a Survey
arXiv:1601.04692
Abstract
This is a survey of the method of graph cuts and its applications to graph clustering of weighted unsigned and signed graphs. I provide a fairly thorough treatment of the method of normalized graph cuts, a deeply original method due to Shi and Malik, including complete proofs. The main thrust of this paper is the method of normalized cuts. I give a detailed account for K = 2 clusters, and also for K > 2 clusters, based on the work of Yu and Shi. I also show how both graph drawing and normalized cut K-clustering can be easily generalized to handle signed graphs, which are weighted graphs in which the weight matrix W may have negative coefficients. Intuitively, negative coefficients indicate distance or dissimilarity. The solution is to replace the degree matrix by the matrix in which absolute values of the weights are used, and to replace the Laplacian by the Laplacian with the new degree matrix of absolute values. As far as I know, the generalization of K-way normalized clustering to signed graphs is new. Finally, I show how the method of ratio cuts, in which a cut is normalized by the size of the cluster rather than its volume, is just a special case of normalized cuts.
122 pages. arXiv admin note: substantial text overlap with arXiv:1311.2492
Cited by in corpus (9)
- A literature survey of matrix methods for data science
- Regularized spectral methods for clustering signed networks
- Semantic Word Clusters Using Signed Normalized Graph Cuts
- Advances in Scaling Community Discovery Methods for Signed Graph Networks
- The Mathematical Foundations of Manifold Learning
- Seating Assignment Using Constrained Signed Spectral Clustering
- Decoupled Variational Embedding for Signed Directed Networks
- Spectral Analysis of Laplacians of an Unweighted and Weighted Multidimensional Grid Graph -- Combinatorial versus Normalized and Random Walk Laplacians
- Induced subgraphs of product graphs and a generalization of Huang's theorem