Spectral Clustering in Directed Networks


Won prize for best presentation of my session of the BYU Spring Research Conference. Presented research on estimating the latent number of clusters in directed networks for use in spectral clustering. The sequence of smallest eigenvalues of the associated graph Laplacian matrix that are real turned out to be a good estimator for the latent clustering structure.

See my slides here.