–
Coffee and Check-In
–
Opening Remarks
–
Graphons and Graph Limits 1
Christian Borgs (UC Berkeley)
–
Break
–
Epidemics 1
Abba Gumel (University of Maryland, College Park)
–
Lunch
–
Networks and Economics 1
Matthew Jackson (Stanford University)
–
Reception
–
Coffee and Check-In
–
Sparse Random Graphs 1
Souvik Dhara (Purdue University)
–
Break
–
Epidemics 2
Tom Britton (Stockholm University)
–
Lunch
–
Networks and Economics 2
Matthew Jackson (Stanford University)
–
Break
–
Influencing Cascades: An Algorithmic View
Amin Saberi (Stanford University)
–
Coffee and Check-In
–
Sparse Random Graphs 2
Souvik Dhara (Purdue University)
–
Break
–
Graphons and Graph Limits 2
Christian Borgs (UC Berkeley)
–
Lunch
–
Networks and Economics 3
Ben Golub (Northwestern University)
–
Coffee and Check-In
–
Locally Convergent Graphs
Christian Borgs (UC Berkeley)
–
Break
–
Segregation Models
Nicole Immorlica (Microsoft Research)
–
Lunch
–
Marrying Graph Convergence and Cascade Models
Yeganeh Ali Mohammadi (Stanford University)
–
Coffee and Check-In
–
Epidemics 3
Tom Britton (Stockholm University)
–
Break
–
Networks and Economics 4
Ben Golub (Northwestern University)
–
Lunch
–
Graphons and Graph Limits 3
Jennifer Chayes (UC Berkeley)