Schedule

All talks will be at Larsen Hall - Harvard Graduate School of Education

Saturday, December 14, 2013

  • 8:00 - Breakfast
  • 8:15 - Registration
  • 8:50 - Opening remarks

  • 9:00-10:00 - Alan Frieze, Geometric Models of Real World Networks (plenary talk)

  • 10:00-10:30 - coffee break

  • 10:30-11:00 - Jeannette Janssen, Pawel Pralat and Rory Wilson, Asymmetric Distribution of Nodes in the Spatial Preferred Attachment Model
  • 11:00-11:30 - Emmanuel Jacob and Peter Morters, A spatial preferential attachment model with local clustering
  • 11:30-12:00 - Mark Kempton and Fan Chung, A local clustering algorithm for connection graphs

  • 12:00-1:30 - lunch break

  • 1:30-2:00 - Michael Brautbar, Moez Draief and Sanjeev Khanna, On the Power of Adversarial Infections in Networks
  • 2:00-2:30 - Konstantin Avrachenkov, Paulo Goncalves and Marina Sokol, On the Choice of Kernel and Labelled Data in Semi-supervised Learning Methods
  • 2:30-3:00 - Kyle Kloster and David Gleich, A Nearly-Sublinear Method for Approximating a Column of the Matrix Exponential for Matrices from Large, Sparse Networks
  • 3:00-3:30 - Damien Lefortier, Liudmila Ostroumova and Egor Samosvat, Evolution of the Media Web

  • 3:30-3:45 - coffee break

  • 3:45-4:15 - Mindaugas Bloznelis and Michal Karonski, Random intersection graph process
  • 4:15-4:45 - Konstantin Avrachenkov, Nelly Litvak, Marina Sokol and Vasily Medyanikov, Alpha current flow betweenness centrality
  • 4:45-5:15 - Akaki Mamageishvili, Matus Mihalak and Dominik Muller, Tree Nash Equilibria in the Network Creation Game
  • 5:15-5:45 - Colin Cooper, Tomasz Radzik and Yiannis Siantos, Fast Low-Cost Estimation of Network Properties Using Random Walks



Sunday, December 15, 2013

  • 9:00-10:00 - Jukka-Pekka Onnela, Combining big data and small models to study networked social systems (plenary talk)

  • 10:00-10:30 - coffee break

  • 10:30-11:00 - Rupei Xu, An Lp Norm Relaxation Approach to Positive Influence Maximization in Social Network under the Deterministic Linear Threshold Model
  • 11:00-11:30 - Bharath Pattabiraman, Mostofa Patwary, Assefaw Gebremedhin, Wei-Keng Liao and Alok Choudhary, Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs
  • 11:30-12:00 - Rishi Ranjan Singh, Keshav Goel, Sudarshan Iyengar and Sukrit, A Faster Algorithm to Update Betweenness Centrality after Node Alteration
  • 12:00-12:30 - Liudmila Ostroumova, Alexander Ryabchenko and Egor Samosvat, Generalized preferential attachment: tunable power-law degree distribution and clustering coefficient
  • 12:30-13:00 - Fan Chung and Olivia Simpson, Solving Linear Systems with Boundary Conditions Using Heat Kernel Pagerank
  • 13:00-13:30 - Ronald Graham, Linus Hamilton, Ariel Levavi, and Po-Shen Loh, Anarchy is Free in Network Creation