BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Simplicity and Complexity of Belief-Propagation  - Elchanan Mossel
  (MIT)
DTSTART:20191014T153000Z
DTEND:20191014T163000Z
UID:TALK131938@talks.cam.ac.uk
CONTACT:HoD Secretary\, DPMMS
DESCRIPTION:There is a very simple algorithm for the inference of posterio
 rs for probability models on trees.\nThis algorithm\, known as ``Belief Pr
 opagation" is widely used in coding theory\, in machine learning\, in evol
 utionary inference\, among many other areas.\nThe talk will be devoted to 
 the analysis of Belief Propagation in some of the simplest probability mod
 els.\nWe will highlight the interplay between Belief Propagation\, linear 
 estimators (statistics)\, the Kesten-Stigum bound (probability) and Replic
 a Symmetry Breaking (statistical physics).\nWe 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 com
 plexity of this ``simple" algorithm. \n\nA wine reception will follow this
  talk in the Central Core. 
LOCATION:Centre for Mathematical Sciences MR2
END:VEVENT
END:VCALENDAR