Spectral Graph Theory, Fall 2015
Applied Mathematics 561/ Computer Science 662
Office Hours: TBA
Time: M-W 2:30-3:45, in AKW 200 (51 Prospect Street)
Here is the course syllabus.
For alternative treatements of material from this course,
I recommend my notes from 2012,
as well as the
notes from other related courses.
For a sales pitch for the type of material I cover in this course
see the notes from my first lecture in 2009.
- Sep 2, 2015:
- Sep 4, 2015:
The Laplacian Matrix and Spectral Graph Drawing
- Sept 9, 2015:
The Adjacency Matrix and Graph Coloring
- Sept 14, 2015:
- Sept 16, 2015:
Rings, Paths, and Cayley Graphs
- Sept 21, 2015:
Conductance, the Normalized Laplacian, and Cheeger's Inequality
- Sept 23, 2015:
- Sept 28, 2015:
- Sept 30, 2015:
How to draw a planar graph.
- Oct 5, 2015:
The spectral gap of planar graphs.
- Oct 7, 2015:
Random walks and diffusion.
- Oct 12, 2015:
Pseudo-random generators from random walks on expanders.
- Oct 14, 2015:
Properties of expander graphs.
- Oct 19, 2015:
A simple construction of expander graphs.
- Oct 26, 2015:
Sparsification by random sampling.
- Oct 28, 2015:
The best sparsifiers.
- Nov 2, 2015:
Iterative Solvers for Linear Equations.
- Nov 4, 2015:
The Conjugate Gradient.
- Nov 9, 2015:
Preconditioning and low stretch spanning trees.
- Nov 11, 2015:
Fast Laplacian solvers by sparsification.
- Nov 16, 2015:
Partitioning in block models.
- Nov 18, 2015:
Expected characteristic polynomials: the finite free convolution.
- Nov 30, 2015:
Quadrature for the finite free convolution.
- Dec 2, 2015:
Interlacing polynomials and Ramanujan Graphs.
- Dec 7, 2015:
The matching polynomial of a graph.
- Dec 9, 2015:
Ramanujan covers of graphs.
This material is based upon work supported by the National Science
Foundation under Grant Nos. 0634957, 0915487, and 1111257.
Any opinions, findings and conclusions or recomendations expressed in
this material are those of the author(s) and do not necessarily
reflect the views of the National Science Foundation (NSF).