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

Date and Time: Thursday, February 23, 2023, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Ulysse Schaller

Different speeds of Rumor Spreading

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.

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