ConceptTheory & Algos
Spectral expander
A d-regular, n-vertex graph whose second smallest Laplacian eigenvalue is at least some positive epsilon.
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.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Connections
4The lectures that define it or assume it, and the concepts next to it.