BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
X-WR-CALNAME:Joint Event: Applied Math Colloquium & Probability Seminar
X-WR-TIMEZONE:Eastern Time (US & Canada)
BEGIN:VEVENT
DTSTAMP:20260514T190745Z
UID:tag:localist.com\,2008:EventInstance_3572699
DTSTART:20180507T201500Z
DTEND:20180507T211500Z
DESCRIPTION:Yury Poyansky (MIT)\n\nTitle: Broadcasting on directed acyclic 
 graphs\n\nAbstract: Consider an infinite directed acyclic graph (DAG) with
  a unique source node X. Let the collection of nodes at distance k from X 
 be called the kth layer. At time zero\, the source node is given a bit. At
  time k each node in the (k - 1)th layer inspects its inputs and sends a b
 it to its descendants in the kth layer.  Each sent bit is flipped with a p
 robability of error $\\delta$. The goal is to be able to recover X with pr
 obability of error better than 1/2 from the values of all nodes at an arbi
 trarily deep layer k. The classical example of trees shows existence of a 
 critical $\\delta$ beyond which recovery is impossible. This talk is about
  locating this threshold for other graphs: random-like and regular 2D and 
 3D grids. A tacit conjecture stimulating this work is that broadcasting is
  impossible in 2D and possible in 3D grids. I will talk about our steps to
 wards resolving it. Joint work with Anuran Makur and Elchanan Mossel.
LOCATION:4-153
SUMMARY:Joint Event: Applied Math Colloquium & Probability Seminar
URL;VALUE=URI:https://calendar.mit.edu/event/joint_event_applied_math_collo
 quium_probability_seminar
CATEGORIES:Conferences/Seminars/Lectures
END:VEVENT
END:VCALENDAR