[theory students] Fwd: Distinguished Lecture (Nov 1): Elchanan Mossel

[Shuchi Chawla <shuchi@xxxxxxxxxxx>]

FYI this lecture should be of interest to several people on this list.

Shuchi

---------- Forwarded message ---------
From: SEBASTIEN ROCH <roch@xxxxxxxxxxxxx>
Date: Fri, Oct 25, 2019, 4:47 PM
Subject: Distinguished Lecture (Nov 1): Elchanan Mossel

Hi all:

Elchanan Mossel from MIT will give a Distinguished Lecture in Mathematics on Friday, November 1 at 4pm in Van Vleck B239. His title and abstract follow. He will be around all day on Friday. If you would like to meet with him or join for lunch/dinner, pleaseÂlet me know.

--Sebastien

**Distinguished Lecture**

Friday, November 1 at 4pm in Van Vleck B239

Speaker: Elchanan Mossel (MIT)

Title: Simplicity and Complexity of Belief Propagation

Abstract: There is a very simple algorithm for the inference of posteriors for probability models on trees. This algorithm, known as ``Belief Propagation" is widely used in coding theory, in machine learning, in evolutionary inference, among many other areas. The talk will be devoted to the analysis of Belief Propagation in some of the simplest probability models. We will highlight the interplay between Belief Propagation, linear estimators (statistics), the Kesten-Stigum bound (probability) and Replica Symmetry Breaking (statistical physics). We will show how the analysis of Belief Propagation allowed to proof phase transitions for phylogenetic reconstruction in evolutionary biology and develop optimal algorithms for inference of block models. Finally, we will discuss the computational complexity of this ``simple" algorithm.Â