# Maximum percolation time in two-dimensional bootstrap percolation

F. Benevides, M. Przykucki

*SIAM Journal on Discrete Mathematics* 29, 224 (2015)

#percolation#discretemath#graphtheory

What is the maximum percolation time in a two-dimensional grid?

We consider a classic model known as bootstrap percolation on the n × n square grid. To each vertex of the grid we assign an initial state, infected or healthy, and then in consecutive rounds we infect every healthy vertex that has at least 2 already infected neighbours. We say that percolation occurs if the whole grid is eventually infected. In this paper, contributing to a recent series of extremal results in this field, we prove that the maximum time a bootstrap percolation process can take to eventually infect the entire vertex set of the grid is We consider a classic model known as bootstrap percolation on the n × n square grid. To each vertex of the grid we assign an initial state, infected or healthy, and then in consecutive rounds we infect every healthy vertex that has at least 2 already infected neighbours. We say that percolation occurs if the whole grid is eventually infected. In this paper, contributing to a recent series of extremal results in this field, we prove that the maximum time a bootstrap percolation process can take to eventually infect the entire vertex set of the grid is 13n^2/18 +O(n).

#### Imaginary replica analysis of loopy regular random graphs

F. Lopez, T. Coolen

Sub. to *Journal of Physics A*

#### Degree-correlations in a bursting dynamic network model

F. Vanni, P. Barucca

*Journal of Economic Interaction and Coordination*

#### Phase transition creates the geometry of the continuum from discrete space

R. Farr, T. Fink

*Physical Review E*

#### Intelligently chosen interventions have potential to outperform the diode bridge in power conditioning

F. Liu, Y. Zhang, O. Dahlsten, F. Wang

*Scientific Reports *

123 / 123 papers