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 behavior of the disease process determined by this rule of spreading. In particular, how large must p(n) be to paint 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. We include further investigations into the general randomized and deterministic cases.
|Original language||English (US)|
|Number of pages||14|
|Journal||Random Structures and Algorithms|
|State||Published - 1998|
ASJC Scopus subject areas
- Computer Graphics and Computer-Aided Design
- Applied Mathematics