Spectral Graph Clustering

Spectral clustering uses the graph Laplacian L = D − A. The k smallest eigenvectors of L (or normalized L) embed nodes into Rᵏ, then k-means finds clusters. The Fiedler vector (2nd eigenvector) reveals the optimal graph bisection.