How Predictable are Online Cascades

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


Duration: 27:54
118 views
0

Lada Adamic, Facebook
Unifying Theory and Experiment for Large-Scale Networks http://simons.berkeley.edu/talks/lada-adamic-2013-11-20



Other Videos By Simons Institute for the Theory of Computing


2013-11-30Overview: Graph Models
2013-11-30Theoretical and Practical Challenges of Recommending Content to Users in a Social Network
2013-11-30Evolving Graphs
2013-11-30On Unifying Asymptotic Complexity with Real-world Performance in Matrix-based Network Computations
2013-11-30Graph Algorithms for Modern Data Models
2013-11-30The Trials and Tribulations of Tractably Counting Triangles
2013-11-30Graph Streams and Sketches: What Can and Can't Be Done
2013-11-30Pre-Processing of Dynamic Networks: Its Impact on Analytics
2013-11-30Estimating Time-Varying Networks
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


Tags:
Simons Institute
Big Data
UC Berkeley
computer science
theory of computing
Lada Adamic