Sign inSign in

Expander graph

A graph is an expander if its second largest eigenvalue is bounded away from one by some constant.
as Ryan O'Donnell defines itCarnegie Mellon UniversityThe wording closest to all 5 definitions
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.

Adjacency matrix2Eigenvalue1Graph degree1Graph eigenvalues1Graph theory1Graph theory basics1Spectral gap1Vertex connectivity1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Ryan O'Donnell

    Carnegie Mellon University · Graduate

    • 16:20Spectral Graph Theory III: Mixing Time
    • 43:42The Existence of a Non-Sofic Group
    • 0:15Expander Graphs Overview
  • Joel Friedman

    UC Berkeley · Research

    A sparse graph with good connectivity properties, often characterized by a spectral gap where the second eigenvalue λ2\lambda_2 is bounded away from zero.
    • 10:57Graphs versus Manifolds in Eigenvalues and Distances Between Subsets

Lectures that assume it

5

Connections

17

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

2 lecturers. 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.