ConceptTheory & Algos
Expander mixing lemma
A theorem stating that in an expander graph, edges in a random path are distributed approximately uniformly.
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
1Connections
3The lectures that define it or assume it, and the concepts next to it.