The d-dimensional bootstrap percolation models with threshold at least double exponential

Abstract: Consider a

p

-random subset

A

of initially infected vertices in the discrete cube

[L]^{d}

, and assume that the neighbourhood of each vertex consists of the

a_{i}

nearest neighbours in the

p m e_{i}

-directions for each

i i n 1, 2, d o t s, d

, where

a_{1} l e a_{2} l e d o t s l e a_{d}

. Suppose we infect any healthy vertex

v i n [L]^{d}

already having

r

infected neighbours, and that infected sites remain infected forever. In this paper we determine the

(d - 1)

-times iterated logarithm of the critical length for percolation up to a constant factor, for all

d

-tuples

(a_{1}, d o t s, a_{d})

and all

r i n a_{2} + d o t s + a_{d} + 1, d o t s, a_{1} + a_{2} + d o t s + a_{d}

. Moreover, we reduce the problem of determining this (coarse) threshold for all

d g e 3

and all

r i n a_{d} + 1, d o t s, a_{1} + a_{2} + d o t s + a_{d}

, to that of determining the threshold for all

d g e 3

and all

r i n a_{d} + 1, d o t s, a_{d - 1} + a_{d}

.

This page was built for publication: The $d$-dimensional bootstrap percolation models with threshold at least double exponential