Individual Files
Presentations
Day One
- Keynote – Tree-like Structure in Social Graphs – Michael J. Mahoney
- Covert and Anomalous Network Discovery and Detection (CANDiD) – Rajmonda S. Caceres
- Community Detection in Random Networks – Ery Arias-Castro
- Sampling and Streaming Algorithms for Counting Small Patterns in Large Graphs – Ali Pinar
- Network Security and Contagion – Asu Ozdaglar
- Discovering Roles in Graphs: Algorithms and Applications – Tina Eliassi-Rad
- On Finding Planted Cliques in Random Graphs – Lev Reyzin
- VizLinc – Kara Greenfield
- Making Diffusion Work for You – B. Aditya Prakash
- Commute Times, Concentration, Discrete Green’s Functions, and Kernel Regression on Graph’ish Data – Chris Long
Day Two
- Keynote – Organization & Structure of Communities in Graphs – Jure Leskovec
- Probabilistic Inference in Big Graphs: Patterns, Techniques, & Tools – Lise Getoor
- Topic-Factorized Ideal Point Estimation Model for Legislative Voting Network – Yizhou Sun
- Large-Scale Graph Mining: Theory and Practice – Vahab Mirrokni
- Spectral Appraoches for Learning Hidden Structure – Sham M. Kakade
- Graphs and Manifold Learning in Neuroimaging – Georg Langs
- The GraphBLAS Standard Effort – Jeremy Kepner
- Graph Explorations at Scale: Processing Trillions of Edges per Second with Single Source Shortest Paths – Fabrizio Petrini