Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, December 01, 2016, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Florian Meier
Consider a graph G and the classical push rumor spreading protocol. Initially, one vertex receives the rumor. Then in every round, every informed vertex selects one of its neighbours uniformly at random and pushes the rumor to the selected neighbour, that is, from now on the selected neighbour knows the rumor as well. For a large class of sparse random multi graphs, we show that it takes at most O(log n) time until almost all vertices are informed. Further we discuss under which assumptions this result extends to simple graphs and what it implies for the pull rumor spreading protocol.
Automatic MiSe System Software Version 1.4803M | admin login