Sign inSign in

Conductance

The conductance of a set of vertices is the minimum probability of a random walk step crossing the boundary of the set, conditioned on being in the set.
as Ryan O'Donnell defines itCarnegie Mellon UniversityThe wording closest to all 3 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.

Probability2Random walk2Random walk on graphs2Edge boundary1Graph Laplacian1Graph theory1Graph volume1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1
  • Ryan O'Donnell

    Carnegie Mellon University · Graduate

    • 0:20Spectral Graph Theory: Conductance and Sparsest-Cut
    • 11:30Spectral Graph Theory: The Laplacian and the Spectral Theorem

Lectures that assume it

1

Connections

11

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

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.