Large-scale Graph Clustering and Message-passing-based Distributed Framework

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=5pwwHUhNPYY


Duration: 28:14
634 views
2

Vahab Mirrokni, Google
Unifying Theory and Experiment for Large-Scale Networks http://simons.berkeley.edu/talks/vahab-mirrokni-2013-11-18



Other Videos By Simons Institute for the Theory of Computing


2013-11-30The Impact of Network Structure on Relational Learning and Inference
2013-11-30How Predictable are Online Cascades
2013-11-30Semi-supervised Learning on Graphs, Using Observed Correlation Structure
2013-11-30The Effect of Social Media on News Consumption
2013-11-30On Sampling in Dynamic Networks for Inference, Experiments, and Interventions
2013-11-30Are Observational Studies of Social Contagion Doomed?
2013-11-30Behavioral Experiments in a Network Formation Game
2013-11-30Issues in Developing Estimable Models of Strategic Network Formation
2013-11-30Challenges of Modeling Network Formation in Tractable Ways
2013-11-30Overview: Network Formation
2013-11-30Large-scale Graph Clustering and Message-passing-based Distributed Framework
2013-11-30Local Clustering and the Blessing of Transitivity
2013-11-30Finding Small Structures in Large Datasets
2013-11-30Asymptotic Analysis of Unlabelled Networks
2013-11-30Know Your Epidemic: But How?
2013-11-30Bayesian Models for Graph Data and the Open Problem of Invariance in Networks
2013-11-30Practice is Better than Theory: Using Approximate Counting to Mine Large Graphs
2013-11-30Limiting Behavior in Large Networks
2013-11-06How Hard Is It To Find A Good Solution?
2013-10-29Highly Scalable Branch-and-Bound for Maximum Monomial Agreement
2013-10-28Tall-and-skinny QR Factorizations in MapReduce


Tags:
Simons Institute
Big Data
UC Berkeley
computer science
theory of computing
Vahab Mirrokni