Search Results for author:
Found 2 papers, 0 papers with code
A Performance Guarantee for Spectral Clustering
The two-step spectral clustering method, which consists of the Laplacian eigenmap and a rounding step, is a widely used method for graph partitioning.
Strong Consistency, Graph Laplacians, and the Stochastic Block Model
We study the performance of classical two-step spectral clustering via the graph Laplacian to learn the stochastic block model.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
