ConceptMathematics
Graph Laplacian
The Laplacian of a d-regular graph defined as times the identity matrix minus the adjacency matrix.
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
2Each in their own terms, from the easiest level.
Graham Cox
A matrix representation of a graph that encodes its connectivity and structure.
Lectures that assume it
8- Cheeger's Inequality
- Community detection with the Bethe-Hessian
- Architectures: Graphs
- Extremal Steklov eigenvalues, free boundary minimal surfaces, and graph realizations
- Spectral Graph Theory: The Laplacian and the Spectral Theorem
- Finding Clusters in Graphs
- Expander Graph Constructions
- The Mathematics of Crime: Predictive Policing and Gang Activity
Connections
19The lectures that define it or assume it, and the concepts next to it.