Cheegers Inequality || @ CMU || Lecture 15d of CS Theory Toolkit @RyanODonnellTeaching
Cheegers Inequality || @ CMU || Lecture 15d of CS Theory Toolkit  @RyanODonnellTeaching
Uploaded May 2020 | Updated November 2026, 4 days ago
A proof of Cheeger's Inequality: basically, the minimum conductance in a graph is bounded by the square-root of the second-smallest eigenvalue of the Laplacian. Lecture 15d 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.

Taught by Ryan O'Donnell (https://www.cs.cmu.edu/~odonnell)

Course homepage on CMU's Diderot system: https://www.diderot.one/course/28/

Thumbnail photo by Rebecca Kiger (rebeccakphoto.com/)
Cheegers Inequality || @ CMU || Lecture 15d of CS Theory Toolkit#87/100: Finding L from the clues || Quantum Computer Programming in 100 Easy LessonsRelaxing ILPs to LPs: Bipartite Max-Perfect-Matching || @ CMU || Lecture 18b of CS Theory ToolkitPauli error estimation via Population RecoveryGoemans Williamson: Rounding the Max-Cut SDP || @ CMU || Lecture 20a of CS Theory ToolkitComputational Indistinguishability || @ CMU || Lecture 25b of CS Theory ToolkitInformation Complexity || @ CMU || Lecture 24c of CS Theory ToolkitA problem re the k-Consistency Algorithm for CSPs  || @ CMU || Recitation 11 of CS Theory ToolkitMax-st-Flow is an LP || @ CMU || Lecture 18a of CS Theory Toolkit#48/100: |v⟩ and −|v⟩ are indistinguishable || Quantum Computer Programming in 100 Easy LessonsAlgorithms for Bounded Treewidth || @ CMU || Lecture 22(c) of CS Theory ToolkitSemidefinite relaxation problems || @ CMU || Recitation 10 of CS Theory Toolkit
Ryan ODonnell |

Cheeger's Inequality || @ CMU || Lecture 15d of CS Theory Toolkit

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER