This is a somewhat flexibly-paced course on spectral graph theory taught in the “hybrid asynchronous” online format. This webpage will contain notes, reading assignments, homework assignments, short videos, and computer demonstrations. Since the course is asynchronous, **there are no simultaneous Zoom sessions during course times. **The course notes below represent everything that I’d say during a lecture. In theory, reading them (and talking with me during office hours) should contain just as much information as an in-person class.

**In-person class sessions are optional and must be booked online in advance because of classroom capacity limits. **Our assigned class space, Boyd 323, can only accommodate 16 of the 44 students registered for this class at any one time. For this reason, if you want to come to an in-person class, I need you to schedule online using this link. You can schedule your class attendance between 1 hour and two weeks in advance.

**Online office hours and one-on-one discussions can also be booked online.** At the moment, the times are relatively limited, and I’m restricting it to 5 students at each discussion. But I will probably adjust as needed over the course of the semester.

Our text for the course is the book draft by Dan Spielman, *Spectral and Algebraic Graph Theory*. There’s a wonderful video lecture by Spielman himself introducing the subject which I encourage you to watch if you’re thinking about whether to take the course.

Graphs are a fascinating and fundamental object in mathematics and computer science, providing a convenient language for expressing everything from social networks to polymer structures. There are deep applications of graph theory in machine learning and knowledge representation, as well as classification, data science, and mathematical finance. In pure mathematics, graph theory interfaces with combinatorics, probability, and geometry as well as being a worthy subject in its own right. (See: four color theorem.)

This is a first course in graph theory (so you don’t need prior graph-theoretic experience to take the course), but we are going to focus on studying graphs via the spectrum (set of eigenvalues) of a matrix (the graph Laplacian). For that reason, **MATH 3000 or MATH 3300 (or equivalent experience)** are required **pre**requisites for this version of the course, as well as the usual prerequisite of MATH 3200. If you don’t have any linear algebra experience, *the best thing to do is sit this one out and take Graph Theory next spring* when it’s planned to return to the usual treatment of the subject.

Computing will be an integral part of the course. In most cases, meaningful examples in spectral graph theory are simply too big to be evaluated by hand. (In particular, we’ll be doing a lot of finding eigenvalues and eigenvectors of matrices, which is really easy numerically and almost impossible to do by hand.) Our book provides some Jupyter notebooks and examples for those with a programming language of choice. Otherwise, I’ll mostly use *Mathematica*. UGA has a site license for *Mathematica* and you can get a copy for your laptop or home computer free of charge. I encourage you to work through some introductory material on *Mathematica*. If you want more Mathematica training, I recommend this online Wolfram U course. Some of the homework assignments and projects will require you to write *Mathematica* programs, and it’s really helpful to be able to use a computer to check your work.

Homework will be turned in via Gradescope. Please use course entry code V88J4N to add yourself to the class. Although this is a self-paced course, **the due dates in Gradescope are the recommended schedule. **Each Gradescope assignment has a due date and a late due date. There is no penalty for submitting homework by the late due date. However, **we can’t accept or grade assignments after the late due date. **It will help you pace yourself if you complete as many assignments as you can by the original due date. If you are not done, please turn in what you have by the late submission date. If you haven’t started on an assignment by the late due date, please move on to a later assignment and contact me– we can make arrangements regarding grading if needed. Please remember to select pages for each question in Gradescope, including problems for which you are not submitting any work (these should have a page with something like “No work submitted for 3.6” or something similar).

The course syllabus is available online here.

## Course Evaluation.

The course will be evaluated 50% on homework assignments, 25% for the midterm exam and 25% for the final exam. The midterm exam will be an in-person open book exam **on Thursday, March 18. ** There are three options for the time– the usual in-class time (book as usual) and in the evening at 6-7:30pm or 7:30-9:00pm (use this booking link). (Remote proctoring arrangements can be made for students who need to be off campus.) You may bring up to 350 pages of paper (and/or any number of printed books), plus any calculator accepted for the math SAT. The final exam will take place at our scheduled time of **Thursday, May 6, 3:30pm-6:30pm.** (Again, remote proctoring options will be available for students who need to be off-campus.)

## Course materials.

In this space will go links to my class notes and in-class problems for the course. The classes with computer demonstrations have Mathematica notebooks posted here.

- Introduction. The diffusion operator.
- Reading: Spectral and Algebraic Graph Theory p. 1-4.
- Video: Diffusion operator computer demonstration.
- Mathematica notebook: Diffusion operator computer demonstration.
- Optional video: 3Blue1Brown “Essence of Linear Algebra”
- Minihomework: Linear algebra review.

- Quadratic forms and the Graph Laplacian.
- Reading: Spectral and Algebraic Graph Theory p. 5-17.
- Video: Graph Laplacian computer demonstration.
- Mathematica notebook: Graph Laplacian computer demonstration.
- Minihomework: Elementary properties of the graph Laplacian

- Eigenvalues, eigenvectors and the Courant-Fischer theorem.
- Note: You’re usually supposed to look at the materials in the order they appear on this list. But this time, I recommend that you start with the video, then read the notes, and finally read the book chapter.
- Video: 3Blue1Brown “Essence of Linear Algebra”
- Reading: Spectral and Algebraic Graph Theory p. 21-26
- Minihomework: Linear algebra of eigenvalues and eigenvectors

- The Laplacian and Graph Drawing.
- Reading: Spectral and Algebraic Graph Theory, p. 27-31
- Minihomework: Isomorphisms and drawings

This homework has a computational component. Below are some links for documentation that may be useful to you. Graphs are built in to Mathematica. If you’re using another language, you should be able to use iGraph.

- Eigenvalue interlacing and the Perron-Frobenius theorem.
- Reading: Spectral and Algebraic Graph Theory, p. 32-38.
- Minihomework: Spectral graph coloring.

- Comparing graphs and the Loewner ordering.
- Reading: Spectral and Algebraic Graph Theory, p. 39-45.
- Minihomework: Comparing graphs.

- Eigenvalues and eigenvectors of some example graphs.
- Path and Cycle graphs.
- Reading: Spectral and Algebraic Graph Theory, p. 51-54.
- Minihomework: Path and Cycle graphs.

- Cayley graphs and Paley graphs.
- Reading: Spectral and Algebraic Graph Theory, p. 55-58.
- (Not coming in Spring 2021 Course) Minihomework: The Paley graphs.

- Generalized hypercubes as approximations of Complete Graphs.
- Reading: Spectral and Algebraic Graph Theory, p. 58-62.
- (Not coming in Spring 2021 Course) Minihomework: Build your own Paley and generalized hypercube graphs.

- The Matrix-Tree Theorem
- Reading: Spectral and Algebraic Graph Theory, p. 110-114.
- (Not coming in Spring 2021 Course) Minihomework: The matrix-tree theorem and leverage probabilities