Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
Mittagsseminar Talk Information |
Date and Time: Thursday, June 29, 2017, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Christoph Koch (University of Warwick)
We consider a classical and well-studied graph process called bootstrap percolation. While bootstrap percolation originally arose in the context of disordered magnetic systems, it has become an important model in the description and analysis of dynamics in social networks. Initially some vertices in a graph are activated, and subsequently each vertex with at least r>1 active neighbours is activated as well. Once a vertex is active, it remains so forever. On a variety of random graph models it is known that even (reasonably) sparse initial activations are likely to cause an activation of most vertices in the graph. However, for other models this critical phenomenon does not occur. We investigate this dichotomy in detail and determine almost tight criteria on the degree sequence of random graphs for both the existence and non-existence of this critical phenomenon. These results are joint work with N. Fountoulakis (Birmingham), M. Kang (TU Graz), and T. Makai (TU Graz).
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 2025 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