ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TT denote the percolation time in the rr-neighbour bootstrap percolation model on Tnd\mathbb{T}_n^d, and let t=t(n)t=t(n) be a time parameter. Range conjecture. Theorem~ holds for all tt in the range

t=o(log⁡n).t=o(\log n).

The preceding results establish the theorem only for a smaller range of tt; extending it to t=o(log⁡n)t=o(\log n) would determine the percolation time for all probabilities in the range 1−o(1)1-o(1).

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.