Expander Graphs Overview || @ CMU || Lecture 16a of CS Theory Toolkit @RyanODonnellTeaching
Expander Graphs Overview || @ CMU || Lecture 16a of CS Theory Toolkit  @RyanODonnellTeaching
Uploaded May 2020 | Updated November 2026, 1 hour ago
An overview of expander graphs: Large, highly-interconnected, yet sparse graphs -- especially explicitly deterministically constructible ones. Lecture 16a 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.

Resources for this lecture:
"Expander graphs and their applications" by Hoory, Linial, and Wigderson.

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/)
Expander Graphs Overview || @ CMU || Lecture 16a of CS Theory ToolkitThe Ellipsoid Algorithm || @ CMU || Lecture 19a of CS Theory Toolkit#23/100: AND/OR/NOT code (for CCode → QCode) || Quantum Computer Programming in 100 Easy LessonsLearning About Quantum States 8:  Learning the eigenvectors via GL(d) representation theoryLearning Parity with Noise|| @ CMU || Lecture 26b of CS Theory ToolkitSpectral Graph Theory: Enter Linear Algebra || @ CMU || Lecture 13c of CS Theory ToolkitMutual Information || @ CMU || Lecture 24b of CS Theory ToolkitMoments, Concentration, and Initializing an Array || @ CMU || Recitation 4 of CS Theory ToolkitExpander Graphs Application 1: Good Codes || @ CMU || Lecture 16b of CS Theory Toolkit#18/100: How Toggles Detective works (Part 1/2) || Quantum Computer Programming in 100 Easy Lessons#16/100: Hadamards unitary even w/ other qubits || Quantum Computer Programming in 100 Easy Lessons#57/100: Grovering with s satisfying strings || Quantum Computer Programming in 100 Easy Lessons
Ryan ODonnell |

Expander Graphs Overview || @ CMU || Lecture 16a of CS Theory Toolkit

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER