Organizing Committee
Abstract

Random graphs, stochastic processes on graphs and algorithms for computations on these structures continue to play a dominant role in algorithmic research and discrete mathematics, with recent applications ranging from web search and recommendation engines to social networks and system biology.

This workshop will be an opportunity for researchers from diverse fields to get together and share problems and techniques for handling and analyzing graphs structures. The connections---mathematical, computational, and practical---that arise between these seemingly-diverse problems and approaches will be emphasized.

Confirmed Speakers & Participants

Workshop Schedule

Monday, March 17, 2014
TimeEventLocationMaterials
9:00 - 9:50Registration: Stochastic Graph Models Workshop11th Floor Lecture Hall and Collaborative Space 
9:50 - 10:00Welcome - ICERM Director11th Floor Lecture Hall 
10:00 - 10:45Evolutionary Dynamics on Graphs - Leslie Ann Goldberg, University of Oxford11th Floor Lecture Hall
11:00 - 11:45Fast Testing of Graph Properties - Artur Czumaj, University of Warwick11th Floor Lecture Hall
12:00 - 1:45Break for Lunch  
1:45 - 2:30New Online Algorithms for Story Scheduling in Web Advertising - Susanne Albers, TU Munich11th Floor Lecture Hall
2:45 - 3:30Trace Complexity of Network Reconstruction - Flavio Chierichetti, Sapienza University of Rome11th Floor Lecture Hall
3:30 - 4:00Coffee/Tea Break11th Floor Collaborative Space 
4:00 - 4:45Distributed Algorithmic Foundations of Dynamic Networks - Gopal Pandurangan, Brown University and NTU, Singapore11th Floor Lecture Hall
5:00 - 6:30Welcome Reception11th Floor Collaborative Space 
Tuesday, March 18, 2014
TimeEventLocationMaterials
9:30 - 10:00Open for Collaboration (Bagels and fruit provided)11th Floor Collaborative Space 
10:00 - 10:45Force-Directed Graph Drawing Using Social Gravity and Scaling - Michael Goodrich, University of California, Irvine11th Floor Lecture Hall
11:00 - 11:45Algorithms on Evolving Data Sets - Mohammad Mahdian, Google INC11th Floor Lecture Hall
12:00 - 1:45Break for Lunch  
1:45 - 2:30Computing Stationary Distribution, Locally - Devavrat Shah, Massachusetts Institute of Technology11th Floor Lecture Hall
2:45 - 3:30Reconstructing Latent Similarities in a Multiplex Social Network - Alex Slivkins, Microsoft Research11th Floor Lecture Hall
3:30 - 4:00Coffee/Tea Break11th Floor Collaborative Space 
4:00 - 4:45Elite, Periphery and Symmetry in Social Networks- An Axiomatic Approach - Chen Avin, Ben-Gurion University11th Floor Lecture Hall
Wednesday, March 19, 2014
TimeEventLocationMaterials
9:30 - 10:00Open for Collaboration (Bagels and fruit provided)11th Floor Collaborative Space 
10:00 - 10:45Impromptu Updating in a Distributed Dynamic Network - Valerie King, University of Victoria11th Floor Lecture Hall
11:00 - 11:45Peeling Algorithms - Michael Mitzenmacher, Harvard University11th Floor Lecture Hall
12:00 - 12:15Group Photo11th Floor Lecture Hall 
12:15 - 1:45Break for Lunch  
1:45 - 2:30On the Complexity of Information Spreading in Dynamic Networks - Rajmohan Rajaraman, Northeastern University11th Floor Lecture Hall
2:45 - 3:30Power Law Complexity - Piotr Sankowski, University of Warsaw11th Floor Lecture Hall
3:00 - 5:20Optimization Algorithms for Planar Graphs (ongoing semester course) - Phil Klein, Brown University and Claire Mathieu, Brown University10th Floor Classroom 
3:30 - 4:00Coffee/Tea Break11th Floor Collaborative Space 
4:00 - 4:45Chasing changes in dynamic structures. - Eli Upfal, Brown University 11th Floor Lecture Hall 
7:00 - 8:30Poster Session and Dessert Reception11th Floor Lecture Hall and Collaborative Space 
Thursday, March 20, 2014
TimeEventLocationMaterials
9:30 - 10:00Open for Collaboration (Bagels and fruit provided)11th Floor Collaborative Space 
10:00 - 10:45The Power of Two Choices in Distributed Voting - Robert Elsaesser, Universität Salzburg11th Floor Lecture Hall 
11:00 - 11:45Efficient computation of the weighted clustering coefficient - Stefano Leonardi, Sapienza University of Rome11th Floor Lecture Hall
12:00 - 1:45Break for Lunch  
1:45 - 2:30Improved bounds and algorithms for graph cuts and network reliability - Aravind Srinivasan, University of Maryland11th Floor Lecture Hall
2:45 - 3:30Online Stochastic Matching- New Results and Open Problems - Vahab Mirrokni, Google Inc.11th Floor Lecture Hall
3:30 - 3:35Please take a moment to complete the survey that was distributed by email.  
3:30 - 4:00Coffee/Tea Break11th Floor Collaborative Space 
4:00 - 4:45Similarity Ranking in Large-Scale Bipartite Graphs - Alessandro Epasto, Universita di Roma La Sapienza11th Floor Lecture Hall
Friday, March 21, 2014
TimeEventLocationMaterials
9:30 - 10:00Open for Collaboration (Bagels and fruit provided)11th Floor Collaborative Space 
10:00 - 10:45Randomly coloring random graphs - Alan Frieze, Carnegie Mellon University11th Floor Lecture Hall
11:00 - 11:45Estimating Network Parameters - Ravi Kumar, Google Inc.11th Floor Lecture Hall
12:00 - 1:30Break for Lunch  
1:30 - 2:30Theory Seminar (ongoing semester seminar)- Improved Approximations for Graph-TSP in Regular Graphs - R. Ravi, Carnegie Mellon University11th Floor Lecture Hall
2:45 - 3:30An Efficient reconciliation algorithm for social networks - Silvio Lattanzi, Google Inc.11th Floor Lecture Hall
3:30 - 4:00Coffee/Tea Break11th Floor Collaborative Space 
4:00 - 4:45On the Glass Ceiling Effect in Social Networks - Zvi Lotker, Ben-Gurion University of the Negev and Claire Mathieu, Brown University11th Floor Lecture Hall

Associated Semester Workshops

Network Science and Graph Algorithms
Semidefinite Programming and Graph Algorithms

Research Clusters

Lecture Videos

On the Glass Ceiling Effect in Social Networks

Zvi Lotker
Ben-Gurion University of the Negev and Claire Mathieu, Brown University
March 21, 2014

Randomly coloring random graphs

Alan Frieze
Carnegie Mellon University
March 21, 2014

Similarity Ranking in Large-Scale Bipartite Graphs

Alessandro Epasto
Universita di Roma La Sapienza
March 20, 2014

Peeling Algorithms

Michael Mitzenmacher
Harvard University
March 19, 2014

Algorithms on Evolving Data Sets

Mohammad Mahdian
Google INC
March 18, 2014

Force-Directed Graph Drawing Using Social Gravity and Scaling

Michael Goodrich
University of California, Irvine
March 18, 2014

Distributed Algorithmic Foundations of Dynamic Networks

Gopal Pandurangan
Brown University and NTU, Singapore
March 17, 2014