1/29: Introduction and Course Overview Newman C1, C6; Easley & Kleinberg C1, C2[slides] 1/31: Graph Theory N. 1, 6; EK. 1, 2[slides] 2/5:No Class (Instructor on travel) 2/7:No Class (Instructor on travel) 2/12: Network Types I N. 2, 3, 4, 5; EK. 3, 13[slides] 2/14:Proposal Presentations (Proposal Report due) 2/19: Network Types II N. 2, 3, 4, 5; EK. 3, 13[slides](HW-1 assignment) 2/21: Large-Scale Structure of Networks I N. 8; EK. 4, 5[slides](HW-1 assignment) 2/26: Large-Scale Structure of Networks II N. 8; EK. 4, 5[slides] (HW-1 due) 2/28: Large-Scale Structure of Networks III N. 8; EK. 4, 5[slides][Wedge Sampling] 3/5: Large-Scale Structure of Networks IV N. 8; EK. 4, 5[slides] (HW-1 due) 3/7: Basic concepts and graph metrics I N. 7, 9[Class cancelled] 3/12: Basic concepts and graph metrics II N. 7, 9[slides] 3/14: Basic concepts and graph metrics III N. 7, 9[tutorial slides][slides](HW-2 assignment) 3/19:No Class (Spring break) 3/21:No Class (Spring break) 3/26: Graph traversal and BFS Selected papers[slides] 3/28: Maximum flow and minimum cut Selected papers[slides](HW-2 due) 4/2: Community detection I N. 11 and selected papers[slides] 4/4:Progress Presentations (Progress Report due) 4/9:Multilayer networks by Dane Taylor(HW-3 assignment) 4/11: Community Detection II N. 11 and selected papers[HLC][CMN][LLM] 4/16: Graph Partitioning I N. 11 and selected papers[slides](HW-3 due) 4/18: Graph Partitioning II N. 11 and selected papers[slides] 4/23: Motif counting Selected papers 4/25: Streaming graph algorithms Selected papers 4/30: Parallel graph analytics I Selected papers(HW-4 assignment) 5/2: Parallel graph analytics II Selected papers 5/7:Final Presentations (Final Report due)(HW-4 due) 5/9:Final Presentations