Overview
Learn to understand which functions minimize and maximize a graph's quadratic form, subject to a normalization constraint, and explore connections to connected components and bipartiteness. This course is part of a semester-long graduate program focusing on math and CS fundamentals for research in theoretical computer science. The teaching method involves lectures and references "Spectral and Algebraic Graph Theory" by Spielman. The course is intended for individuals interested in theoretical computer science and mathematics.
Syllabus
Introduction
How small can the quadratic form be
Scaling considerations
Natural scaling
Intuition for maximizing quadratic form
Proof
Comments
Taught by
Ryan O'Donnell