BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Tamas Makai
DTSTART:20200819T010000Z
DTEND:20200819T020000Z
DTSTAMP:20260423T021242Z
UID:CMSAcomb/5
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CMSAcomb/5/"
 >Majority dynamics in the dense binomial random graph</a>\nby Tamas Makai 
 as part of Australasian Combinatorics Seminar\n\n\nAbstract\nMajority dyna
 mics is a deterministic process on a graph which evolves in the following 
 manner. Initially every vertex is coloured either red or blue. In each ste
 p of the process every vertex adopts the colour of the majority of its nei
 ghbours\, or retains its colour if no majority exists.\nWe analyse the beh
 aviour of this process in the dense binomial random graph when the initial
  colour of every vertex is chosen independently and uniformly at random. W
 e show that with high probability the process reaches complete unanimity\,
  partially proving a conjecture of Benjamini\, Chan\, O'Donnel\, Tamuz and
  Tan.\nThis is joint work with N. Fountoulakis and M. Kang.\n
LOCATION:https://researchseminars.org/talk/CMSAcomb/5/
END:VEVENT
END:VCALENDAR