The (temporary) webpage for the Spring 2023 offering is on Canvas.
Spectral graph theory is about how eigenvalues, eigenvectors, and other linear-algebraic quantities give us useful information about a graph, for example about how well-connected it is, how well we can cluster or color the nodes, and how quickly random walks converge to a limiting distribution. Spectral graph theory has turned out to be extremely useful in theoretical...
Read more about CS229r: Spectral Graph Theory in Computer Science