Michal Przykucki

activity

20132019

U

-bootstrap percolation models have non-trivial phase transitions

3 citations · 4 across the 2 of their papers we have counts for

collaborators

Showing 2015Show all

2 papers · 1 filter

math.CO2015

On the maximum running time in graph bootstrap percolation

Béla Bollobás, Michał Przykucki, Oliver Riordan +1

Graph bootstrap percolation is a simple cellular automaton introduced by Bollobás in 1968. Given a graph $H$ and a set $G \subseteq E (K_{n})$ we initially "infect" all edges in $G$ a…

math.PR2015

The time of graph bootstrap percolation

Karen Gunderson, Sebastian Koch, Michał Przykucki

Graph bootstrap percolation, introduced by Bollobás in 1968, is a cellular automaton defined as follows. Given a "small" graph $H$ and a "large" graph $G = G_{0} \subseteq K_{n}$ , in c…