Bootstrap Percolation on Random Graphs

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


Duration: 42:29
644 views
6

Mihyun Kang, Technische Universität Graz, Austria
Random Instances and Phase Transitions
https://simons.berkeley.edu/talks/mihyun-kang-2016-05-05



Other Videos By Simons Institute for the Theory of Computing


2016-05-06A Framework for Imperfectly Observed Networks
2016-05-06Phase Transitions in Low-Rank Matrix Estimation
2016-05-06Analysis of Algorithms on Dense Matrices using Approximate Message Passing
2016-05-06Extremal Cuts of Sparse Random Graphs
2016-05-06Recent Advances in Counting Sparse Graphs
2016-05-06Average-Case Overcomplete Tensor Decomposition
2016-05-06Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model
2016-05-06Information-Theoretic Bounds and Phase Transitions in Community Detection and High-Dimensional Clust
2016-05-06Planted Clique, Sum-of-Squares and Pseudo-Calibration
2016-05-06Spatial Coupling as a Proof Technique
2016-05-06Bootstrap Percolation on Random Graphs
2016-05-06The lower tail: Poisson approximation revisited
2016-05-06Stochastic Integration via Error-Correcting Codes
2016-05-06On the Chromatic Number of Random Regular Graphs
2016-05-06Solvable Model of Unsupervised Feature Learning
2016-05-05Recovering Biological Networks, and the Ubiquitous Inverse of the Variance-Covariance Matrix
2016-04-29Should Social Science Be Problem Oriented?
2016-04-29What the Crowd Knows About the Crowd
2016-04-29The Fragility of Organizations: A Simulation and Empirical Examples
2016-04-29Counterfactual Inference Using Behavioral Models: An Application to Search Advertising
2016-04-29Understanding Social Behavior During Crisis Events using Digital Traces


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Counting Complexity and Phase Transitions
Mihyun Kang