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: Tuesday, May 14, 2013, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Hafsteinn Einarsson

A short survey on bootstrap percolation

Bootstrap percolation is a process of spread of activation/infections/rumours/defaults on a graph G. For a given initial active set the process proceeds in rounds where in each round we add to the set of active vertices all inactive vertices which have at least k active neighbours for some constant k. If, after the process terminates, the whole graph is active, we say that the initial set percolates.

The task of determining a sharp threshold for bootstrap percolation on the grid has been a popular topic since 1979 when it was first introduced by Chalupa, Leath and Reach. It was however not resolved completely until in 2012 by Balog, Bollobás, Duminil-Copin and Morris. I will talk about this result as well as a recent result by Janson, Luczak, Turova and Vallier who completely characterized Bootstrap Percolation on the Erdős–Rényi random graph.

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