Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, December 01, 2016, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Florian Meier

Rumor spreading: Push is fast on sparse random graphs

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.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login