Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, February 23, 2023, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Ulysse Schaller
The spread of information in social networks can be studied by looking at rumour spreading on certain graph models. In the push&pull protocol of rumour spreading, there is initially one informed vertex, and in every round each vertex will contact a neighbour uniformly at random, and if one of the two vertices is informed the rumour is transmitted to the other vertex. The speed of rumour spreading is measured by the number of rounds needed to get the entire graph informed about the rumour. In this talk, I will show that the speed of rumour spreading can heavily depend on the chosen graph model. I will illustrate it by presenting two results. The first one, by Doerr, Fouz and Friedrich, tells us that rumours spread in logarithmic time in the Preferential Attachment graph model. On the other hand, Janssen and Mehrabian showed a polynomial lower bound for the spreading time in Spatial Preferential Attachment graphs. This raises the question of whether information spreads quickly or slowly in social networks.
Automatic MiSe System Software Version 1.4803M | admin login