The course covers the learning outcomes and goals of understanding algebraic graph theory, including adjacency algebra, spectral graph theory, Laplacian matrices, spectral graph drawing, spectral clustering, Cheeger's inequality, and graph isomorphism. The course teaches skills such as drawing planar graphs, working with Laplacian quadratic forms, analyzing boundaries of sets, and approximating graphs. The teaching method involves lectures and theoretical explanations. The intended audience for this course is individuals interested in advanced mathematics, graph theory, and network analysis.
Overview
Syllabus
Miracles of Alget
A Graph and its Adjacency
Algebraic and Spectral Graph
Spring Networks
Drawing Planar Graphs with
Tutte's Theorem 63
The Laplacian Quadratic Form
The Laplacian Matrix of G
Weighted Graphs
Spectral Graph Theory
Courant-Fischer Theorem
Spectral Graph Drawing
Dodecahedron
Erdős's co-authorship graph
When there is a "nice" drawi
Measuring boundaries of sets
Spectral Clustering and Partition
Cheeger's Inequality - sharpe
Schild's tighter analysis by eq
The Graph Isomorphism Pro
The Graph Automorphism F
Approximating Graphs A graph H is an e-approxima
Sparse Approximations
To learn more
Taught by
Joint Mathematics Meetings
