Big Graphs 2016 - Workshop: "Big Graphs: Theory and Practice"

Graphs are a classical topic of study in combinatorics and algorithms, with applications to the study of social networks, the spread of diseases, biological systems and much more. The goal of this workshop is to bring together researchers in both theory and applications who study big graphs, to learn from each other and to facilitate new collaborations. Topics to be covered include community detection, link prediction, modelling, statistical relational learning, social networks, graph sparsification and other recent advances in linear-time algorithms. Talks will consist of both surveys and more specialized technical talks. We will also have allocated time for collaboration and informal discussions.
Venue: TBD, UC San Diego
Parking: Hopkins parking structure ($8/day)
For further details, please contact the organizers: Shachar Lovett and Julian McAuley.
Confirmed speakers include:
Anima Anandkumar, UC Irvine
Christian Borgs, Microsoft Research
Jennifer Chayes, Microsoft Research
Tina Eliassi-Rad, Rutgers
Lise Getoor, UC Santa Cruz
Sharad Goel, Stanford
Alexander Ihler, UC Irvine
Dmitri Krioukov, Northeastern
Aleksander Madry, MIT
Johan Ugander, Stanford
Richard Peng, Georgia Tech
Padhraic Smyth, UC Irvine