Program
| 9:25 – 9:30 | Welcome | |
| 9:30 – 10:00 | Silvio Lattanzi | Local Algorithms and Large Scale Graph Clustering |
| 10:00 – 10:30 | Keren Censor-Hillel | A New Perspective on Vertex Connectivity |
| 10:30 – 11:00 | Philipp Woelfel | Small World Navigability – Limits of Efficiency |
| 11:00 – 11:30 | Coffee break | |
| 11:30 – 12:00 | George Giakkoupis | Tight bounds for rumor spreading with graph expansion |
| 12:00 – 12:30 | Sharad Goel | “Going Viral” and the Structure of Online Diffusion |
| 12:30 – 1:00 | Gopal Pandurangan | Network Discovery via Gossip: Analyzing Dynamically Evolving Distributed and Social Networks |
| 1:00 – 2:30 | Lunch | |
| 2:30 – 3:00 | Anirban Dasgupta | Aggregating information from a crowd |
| 3:00 – 3:30 | Vahab Mirrokni | Large-scale graph (overlapping) clustering in MapReduce and Beyond |
| 3:30 – 4:00 | Ravi Kumar | TBA |
| 4:00 – 4:30 | Coffee break | |
| 4:30 – 5:00 | Sandeep Pandey | TBA |
| 5:00 – 5:30 | Bo Pang | TBA |