The Combinatorics of Large Sparse Graphs

Schedule of talks

Date Time Talks
Monday
June 7
8:45-9:30 Registration and Coffee
9:30-9:35 Welcome by Vicki Golich, Dean COAS
9:35-10:35 Overview and outlines
10:35-11:00 Coffee break
11:00-12:00 Amin Saberi: Algorithmic game theory and the internet
12:00-2:00 Welcome Luncheon and conference photo
2:00-3:00 Generative models - preferential attachment schemes
3:00-3:30 Coffee break
3:30-4:30 Ron Graham: Sparse quasi-random graphs
Tuesday
June 8
9:00-9:30 Morning Coffee & Snacks
9:30-10:30 Duplication models for biological networks
10:30-11:00 Coffee break
11:00-12:00 Joel Spencer: Erdös Magic
12:00-2:00 Lunch
2:00-3:00 The rise of the giant component
3:00-3:30 Coffee break
3:30-4:30 Problem session
5:00-7:00 Gathering at Dr. Reid's house
Wednesday
June 9
9:00-9:30 Morning Coffee & Snacks
9:30-10:30 The small world phenomenon:
average distance and diameter I
10:30-11:00 Coffee break
11:00-12:00 Doug Jungreis: Preferential attachments and generalizations
12:00-2:00 Lunch
2:00-3:00 The small world phenomenon:
average distance and diameter II
3:00-3:30 Coffee break
3:30-4:30 Joshua Cooper: A permutation regularity Lemma
Thursday
June 10
9:00-9:30 Morning Coffee & Snacks
9:30-10:30 Eigenvalues of random power law graphs
10:30-11:00 Coffee break
11:00-12:00 Lincoln Lu: Several concentration inequalities for power law graphs
12:00-2:00 Lunch
2:00-3:00 Semi-circle law for the Laplacian
of random graphs with given degrees
3:00-3:30 Coffee break
3:30-4:30 Problem Session
Friday
June 11
9:00-9:30 Morning Coffee & Snacks
9:30-10:30 Coupling on-line and off-line
analyses of power law graphs
10:30-11:00 Coffee break
11:00-12:00 The hybrid models and beyond
12:00 End of conference

All titles in red are talks given by Fan Chung Graham.