Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, December 13, 2016, 12:15 pm
Duration: 45 minutes
Location: CAB G51
Speaker: Michal Svagerka
Distributed voting is a fundamental topic in distributed computing. In pull voting, in each step every vertex chooses a neighbour uniformly at random, and adopts its opinion. The voting is completed when all vertices hold the same opinion. On many graph classes including regular graphs, pull voting requires Ω(n) expected steps to complete, even if initially there are only two distinct opinions, and the majority can still win with probability proportional to its representation. The paper by Cooper, Elsässer, Rodzik considers a related process called two-sample pull voting, in which every vertex samples two neighbours in each step and adopts their opinions only if they coincide. It is shown that on d-regular graphs the process completes in O(log n) and the majority opinion wins with high probability.
Automatic MiSe System Software Version 1.4803M | admin login