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, November 05, 2020, 12:15 pm

Duration: 30 minutes

Location: Zoom: conference room

Speaker: Ulysse Schaller

Shape of Epidemic Curves in Geometric Inhomogeneous Random Graphs

We study the speed of disease spreading in Geometric Inhomogeneous Random Graphs (GIRGs), a random graph model that shares a lot of properties with real-world social networks. In this model, the transmission time between two neighbor vertices increases with their degree, which accounts for the empirically observed fact that people that have a lot of connections "activate" a given connection less often. We identify two growth regimes, corresponding to polynmoial and quasi-exponetial epidemic curves, that are added to the previously known explosive regime in which nodes are infected in constant time, regardless of their distance to the source of the disease (i.e. the first infected node). This shows that we can observe a variety of spreading speeds when geometry is integrated in the model.

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