Tentative  schedule (a detailed version, including references and teaching material, is available here  (RvdH is professor Remco van der Hofstad, SB is professor Shankar Bhamidi)

Week 1: Basic Material

Day 1: Empirics of Complex Networks
Day 2: Basic Models: locally tree-like
Day 3: Structural Properties of Random Graphs
Day 4: Branching process comparisons and intro to dense graphs
Day 5: Dense models vs sparse models

Week 2: Advanced Material

Day 6: Local weak convergence
Day 7: Community detection
Day 8: Information diffusion on networks
Day 9: Network vulnerability
Day 10: Statistics for dynamical networks