BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
X-WR-CALNAME:MIT-Harvard Communications Information Networks Circuits and S
 ignals (CINCS) / Hamilton Institute Seminar
X-WR-TIMEZONE:Eastern Time (US & Canada)
BEGIN:VEVENT
DTSTAMP:20260914T214815Z
UID:tag:localist.com\,2008:EventInstance_36448189327850
DTSTART:20210428T140000Z
DTEND:20210428T150000Z
DESCRIPTION:Title: Broadcasting in random graphs \n\nAbstract: Consider a s
 et of n agents\, each of whom has a single message to convey to all other 
 agents. The messages are all of the same length. Time is divided into roun
 ds\, and during each round\, each agent may broadcast a single message. Ag
 ents are represented as nodes of a directed communication graph\, and a br
 oadcast is received error-free by all (out)-neighbours of the broadcasting
  node. The problem is to minimise the number of rounds until all agents ha
 ve received all messages.\n\nThis is known as the gossiping problem\, and 
 various versions of it have been studied. In our version\, the communicati
 on graph is a dense directed Erdos-Renyi random graph G(n\,p)\, and we see
 k simply decentralised gossip algorithms. We consider two algorithms\, ran
 dom relaying and random linear network coding. We consider a sequence of g
 raphs with p fixed and n tending to infinity. Our main results are that ra
 ndom relaying requires Theta(log n) rounds\, whereas random linear network
  coding requires only a constant number of rounds.\n\nPlease contact Moll 
 Kruko @ mkruko@mit.edu for the Zoom log-in information.
LOCATION:Zoom
SUMMARY:MIT-Harvard Communications Information Networks Circuits and Signal
 s (CINCS) / Hamilton Institute Seminar
URL;VALUE=URI:https://events.seas.harvard.edu/event/mit-harvard_communicati
 ons_information_networks_circuits_and_signals_cincs_hamilton_institute_sem
 inar_3254
CATEGORIES:Colloquia / Seminar / Lecture
END:VEVENT
END:VCALENDAR