Lecture Notes for Math 262
Combinatorics of Large Sparse Graphs

This site contains lecture notes from a graduate course conducted by Dr. Fan Chung Graham during the Spring of 2004 at the University of California, San Diego Dept. of Mathematics. The Lecture notes were transcribed by class members, and no guarantee is made as to their correctness. The lecture note project was organized by Ross M. Richardson, and any correspondence about the notes may be directed to him.


Image blatently stolen from Lincoln Lu

Date Assigned Course Notes (PDF)
3/30 Ross Richardson 3/30 - Introduction
4/1 Picture Day  
4/6 Manda Riehl 4/6 - Preferential Attachment Model
4/8 Kevin Costello 4/8 - Preferential Attachment II
4/13 Dan Felix 4/13 - Martingales and Azuma's Inequality
4/15 Jake Wildstrom 4/15 - The Vertex-Duplication Model
4/22 Blair Angle 4/22 - Large Deviation Inequalities
4/27 Steven Butler 4/27 - Expected Degrees and Giant Components
4/29 Chris Calabro 4/29 - Partial Duplication Model
5/4 Alon Regev 5/4 - Quasi-Random Sequences LaTeX version(Thanks to Steve)
5/6 Steve Butler 5/6 - Giant Component and Matrix Tree Theorem
5/11 Kevin Costello 5/11 - Rise of the Giant Component in G(w)
5/13 Jake Wildstrom 5/13 - Giant Component, Continued
5/18 Ross Richardson 5/18 - Average Distance in G(w), part I
5/20 Dan Felix 5/20 - Average Distance in G(w), part II
5/25 Chris Calabro 5/25 - Estimating the Spectral Radius
5/27 Steve Butler 5/27 - Eigenvalues of Random Power Law Graphs
6/1 Steve Butler 6/1 - Eigenvalues for Random Graphs
6/3 Paper Reference 6/3 - The average distances in random graphs with given expected degrees by Chung and Lu
This file last modified Wednesday, 16-Jun-2004 18:45:28 PDT