Maximum percolation time in two-dimensional bootstrap percolation

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

SIAM Journal on Discrete Mathematics 29, 224 (2015)

F. Benevides, M. Przykucki

LQ placeholderWhat 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).

LQ placeholderNetwork valuation in financial systems

Network valuation in financial systems

P. Barucca, M. Bardoscia, F. Caccioli, M. D’Errico, G. Visentin, G. Caldarelli, S. Battiston

Mathematical Finance

LQ placeholderThe space of functions computed by deep layered machines

The space of functions computed by deep layered machines

A. Mozeika, B. Li, D. Saad

Sub. to Physical Review Letters

LQ placeholderReplica analysis of overfitting in generalized linear models

Replica analysis of overfitting in generalized linear models

T. Coolen, M. Sheikh, A. Mozeika, F. Aguirre-Lopez, F. Antenucci

Sub. to Journal of Physics A

LQ placeholderTaming complexity

Taming complexity

M. Reeves, S. Levin, T. Fink, A. Levina

Harvard Business Review

LQ placeholderReplica analysis of Bayesian data clustering

Replica analysis of Bayesian data clustering

A. Mozeika, T. Coolen

Journal of Physics A

LQ placeholderDegree-correlations in a bursting dynamic network model

Degree-correlations in a bursting dynamic network model

F. Vanni, P. Barucca

Journal of Economic Interaction and Coordination

124 / 124 papers