Monday, May 18

9:45-10:00     Welcome from J.M. Gibson (Founding Dean, College of Science, NEU), tentative
                       Welcome from C. King (Chair, Department of Mathematics)
                       Welcome from R. Ghanadan (DARPA), tentative
10:00-11:00    Michael Farber “Topology of large random simplicial complexes”
11:00-11:30    Coffee Break
11:30-12:30    Richard Kenyon “Fixed-energy harmonic functions and acyclic orientations”
12:30-14:30    Lunch
14:30-15:30    David Rideout “Complex networks as Lorentzian geometries”
15:30-16:00    Coffee Break
16:00-17:00    Discussion

Tuesday, May 19

10:00-11:00    Matthew Kahle “The threshold for homology with integer coefficients”
11:00-11:30    Coffee Break
11:30-12:30    Yuliy Baryshnikov “Random configurations with topological constraints”
12:30-14:30    Lunch
14:30-15:30    Ginestra Bianconi “Emergent complex network geometry”
15:30-16:00    Coffee Break
16:00-17:00    Discussion

Wednesday, May 20

10:00-11:00    Anthony Coolen “New analytical tools for loopy random graphs”
11:00-11:30    Coffee Break
11:30-12:30    Pavel Krapivsky “Network growth by copying”
12:30-14:30    Lunch
14:30-15:30    Mei Yin “Asymptotics for sparse exponential random graph models”
15:30-16:00    Coffee Break
16:00-17:00    László Miklós Lovász “Left and right convergence of bounded degree graphs”
18:00              Dinner

Thursday, May 21

10:00-11:00    David Mayer TBD
11:00-11:30    Coffee Break
11:30-12:30    Yufei Zhao “Large deviations in random graphs”
12:30-14:30    Lunch
14:30-15:30    Sukhada Fadnavis “Asymptotic properties of the edge-triangle ERGM”
15:30-16:00    Coffee Break
16:00-17:00    Discussion

Friday, May 22

10:00-11:00    Eric Kolaczyk “On the propagation of low-rate measurement error to subgraph counts in large, sparse networks”
11:00-11:30    Coffee Break
11:30-12:30    Sayan Mukherjee TBD
12:30-14:30    Lunch
14:30-15:30    Iraj Saniee “Hyperbolicity and centrality in informational networks”
15:30-16:00    Coffee Break
16:00-17:00    Discussion