Random disease on the square grid

We introduce some generalizations of a nice combinatorial problem, the central notion of which is the so-called Disease Process. Let us color independently each square of an n×n chessboard black with a probability p(n), this is a random initial configuration of our process. Then we have a deterministic painting or expansion rule, and the question is the behaviour of the disease process determined by this rule of spreading. In particular, how large p(n) must be for painting the whole chessboard black? The main result of this paper is the almost exact determination of the threshold function in the fundamental case of this Random Disease Problem. Further investigations are involved about the general randomized and deterministic cases.

• Type: Journal
• Year: 1998
• Where: RSA
• Authors: József Balogh, Gábor Pete
• Keywords: Disease Process, Nice Combinatorial Problem, RSA 1998, So-called Disease Process