Dissertation Talk: Phase transitions in inference on sparse random graphs

In this talk, we will discuss some recent progress: a general-purpose algorithm for inference based on semidefinite programming, along with evidence for the optimality of this algorithm on a variety of inference problems on sparse random graphs.