Sign inSign in

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.
as Ryan O'Donnell defines itCarnegie Mellon University
Watch it explained

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

1
  • Ryan O'Donnell

    Carnegie Mellon University · Graduate

    • 0:30Cheeger's Inequality

Connections

6

The lectures that define it or assume it, and the concepts next to it.

Concepts4

Lectures2

1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.