  Consider a graph $G$ and an initial random configuration, where each node is
black with probability $p$ and white otherwise, independently. In discrete-time
rounds, each node becomes black if it has at least $r$ black neighbors and
white otherwise. We prove that this basic process exhibits a threshold behavior
with two phase transitions when the underlying graph is a $d$-dimensional torus
and identify the threshold values.
