1:30–4:00 pm
Stevanovich Center
MS 112
5727 S. University Avenue
Chicago, Illinois 60637
Lectures 5 & 6: Spectral methods in network analysis
Speaker: David Bindel, Cornell University
Friday, June 21, 2019, at 1:30-2:30 PM and 3:00-4:00 PM
Linear algebra methods play a central role in modern methods for large-scale network analysis. The same approach underlies many of these methods. First, one tells a story that associates the network with a matrix, either as the generator of a linear time-invariant dynamical process on the graph or as a quadratic form used to measure some quantity of interest. Then, one uses the eigenvalues and eigenvectors of the matrix to reason about the properties of the dynamical system or quadratic form, and from there to understand the network. We describe some of the most well-known spectral network analysis methods for tasks such as bisection and partitioning, clustering and community detection, and ranking and centrality. These methods largely depend only on a few eigenvalues and eigenvectors, but we will also describe some methods that require a more global perspective, including methods that we have developed for local spectral clustering and for graph analysis via spectral densities.