Topics in Theoretical Computer Science: An Algorithmist's Toolkit (MIT 18.409)
by Jonathan Kelner · MIT OpenCourseWare
Geometric and spectral techniques used in modern algorithm design, starting with spectral graph theory: graph Laplacians, spectral partitioning, Cheeger's inequality, expanders and random walks. 25 lecture-note files and problem sets equip learners to apply eigenvalue methods to algorithmic problems.
More resources on Spectral Graph Theory
Wolfram MathWorld
MathWorld is an online mathematics encyclopedia from Wolfram Research offering detailed, browsable articles on topics across the math spectrum, including algebra, geometry, calculus, and number theory. Each entry includes definitions, theorems, formulas, diagrams, worked examples, and links to further reading.
Spectral and Algebraic Graph Theory
Learn spectral and algebraic graph theory with this course by Daniel A. Spielman. Explore connections between linear algebra and graph properties!
Spectral Graph Theory
Fan Chung's CBMS lecture monograph on the eigenvalues of the normalized graph Laplacian, covering isoperimetric and Cheeger inequalities, expanders, random walks, diameter bounds and quasi-random graphs; prepares readers with linear algebra and graph theory background to read research literature.