The Combinatorics of Large Sparse Graphs

Notes and References for the talks

These are some notes and references for the talks given at the workshop. With permission from the speakers, we will put up the slides used for the talks.

References and Notes for Fan Chung's lectures:

For the entire series of lectures:
Class notes from a graduate course on the Combinatorics of Large Sparse Graphs offered by Dr. Fan Chung Graham held at UCSD in Spring 2004.
For Lecture 1:
An article outlining the history of power law models by Michael Mitzenmacher.
For Lecture 2:
- A random graph model for massive graphs by Aiello, Chung, Lu.
- Random evolution in massive graphs by Aiello, Chung, Lu.
For Lecture 3:
Duplication models for biological networks by Chung, Lu, Dewdney, Galas.
For Lectures 5 and 6:
The average distances in random graphs with given expected degrees by Chung, Lu.
For Lecture 7:
Eigenvalues of random powerlaw graphs by Chung,Lu,Vu.
For Lectures 9 and 10:
The small world phenomenon in hybrid power law graphs by Chung, Lu.

Notes for Amin Saberi's talk:

Powerpoint Slides of the talk.
On Approximately Fair Allocations of Indivisible Goods by Lipton, Markakis, Mossel, Saberi.

Notes for Ron Graham's talk:

Slides of the talk.
Sparse quasi-random graphs by Chung, Graham.

Notes for Doug Jungreis' talk:

Slides of the talk.
Generalizations of Polya's urn problem, by Chung, Handjani, Jungreis.

Notes for Josh Cooper's talk:

Powepoint Slides of the talk.
A permutation regularity lemma, by Cooper.