Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model

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


Duration: 53:10
274 views
0

Charilaos Efthymiou, Georgia Institute of Technology
Random Instances and Phase Transitions
https://simons.berkeley.edu/talks/charilaos-efthymiou-2016-05-03



Other Videos By Simons Institute for the Theory of Computing


2016-05-09Teaching an old code a new trick
2016-05-06Sum of Squares SDP Relaxations on Random Tensors
2016-05-06Counting Solutions to Random Constraint Satisfaction Problems
2016-05-06Phase Transitions in Random CSPs
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-06Bootstrap Percolation on Random Graphs
2016-05-06Shotgun Assembly of Graphs
2016-05-06Phase Transitions in Semidefinite Relaxations (A Fast & Robust Algorithm for Community Detection)
2016-05-06Contagious Sets in Random Graphs
2016-05-06Community Detection with the Non-Backtracking Operator
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


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