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