1 paper
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…