ConceptTheory & Algos
Cheeger's inequality
A theorem stating that the graph conductance is bounded above by a constant times the square root of the second smallest eigenvalue of the Laplacian matrix.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Ryan O'Donnell
Connections
6The lectures that define it or assume it, and the concepts next to it.