Spectral Graph Theory: conductance and Sparsest-Cut || @ CMU || Lecture 15b of CS Theory Toolkit
Spectral Graph Theory III: The conductance of vertex sets, the minimum conductance in a graph, the Sparsest-Cut problem, and Cheeger's inequality stated. Lecture 15b of "CS Theory Toolkit": a semester-long graduate course on math and CS fundamentals for research in theoretical computer science, taught at Carnegie Mellon University.
Resource for this lecture:
"Spectral and Algebraic Graph Theory" book by Spielman
Taught by Ryan O'Donnell (https://www.cs.cmu.edu/~odonnell)
Course homepage on CMU's Diderot system: https://www.diderot.one/course/28/
Filmed by Cole H. for Panopto (http://www.panopto.com/)
Thumbnail photo by Rebecca Kiger (https://www.rebeccakphoto.com/)