Spectral Clustering Revisited: Information Hidden in the Fiedler Vector

no code implementations • 22 Mar 2020 • Adela DePavia, Stefan Steinerberger

We are interested in the clustering problem on graphs: it is known that if there are two underlying clusters, then the signs of the eigenvector corresponding to the second largest eigenvalue of the adjacency matrix can reliably reconstruct the two clusters.

Clustering Stochastic Block Model