ConceptMathematics
Adjacency matrix
A square matrix used to represent a finite graph, where the element at row i and column j is 1 if there is an edge between vertices i and j, and 0 otherwise.
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
4Each in their own terms, from the easiest level.
Julian Shun
An matrix with a 1 bit in row i and column j if an edge exists from vertex i to vertex j, and 0 otherwise.Marten van Dijk
A matrix containing entries representing whether an edge exists between two vertices in a graph.Sebastian Cioaba
A 0-1 symmetric matrix representing the connections between vertices in an undirected, simple graph.
Lectures that assume it
16The first 12 are shown.
- Community detection with the Bethe-Hessian
- Arch4Health: 4th Workshop on Architecture for Health
- Architectures: Graphs
- Dynamic Programming: All-Pairs Shortest Paths
- Search-to-Decision, Padding, Dichotomy Theorems
- Nodal surplus and the spectral decomposition of the cycle space
- Spectral Graph Theory: The Markov Transition Operator
- Spectral Graph Theory: The Laplacian and the Spectral Theorem
- Dinur's Proof of the PCP Theorem: Outline
- Demand for Health (Part 1)
- Graphs versus Manifolds in Eigenvalues and Distances Between Subsets
- Sturmian discrete and metric graphs - appearance and absence of gaps
Connections
28The lectures that define it or assume it, and the concepts next to it.
Concepts8
Show 2 moreShow fewer
Lectures20
- Graph Optimization
- Maximizing algebraic connectivity for graphs of given order and size.
- Graph Theory III
- Recovering Riemannian Metric Distance from Random Geometric Graphs
- Community detection with the Bethe-Hessian
- Arch4Health: 4th Workshop on Architecture for Health
Show 14 moreShow fewer
- Architectures: Graphs
- Dynamic Programming: All-Pairs Shortest Paths
- Search-to-Decision, Padding, Dichotomy Theorems
- Nodal surplus and the spectral decomposition of the cycle space
- Spectral Graph Theory: The Markov Transition Operator
- Spectral Graph Theory: The Laplacian and the Spectral Theorem
- Dinur's Proof of the PCP Theorem: Outline
- Demand for Health (Part 1)
- Graphs versus Manifolds in Eigenvalues and Distances Between Subsets
- Sturmian discrete and metric graphs - appearance and absence of gaps
- Finding Clusters in Graphs
- Expander Graph Constructions
- Resonances on Geometrically Finite Graphs and Buildings
- Join Ordering: Top-Down / Transformational