Dynamic monopolies in tori. (Q1427199)

The authors study the following problem. Let \(G\) be a simple connected graph where every node is colored either black (a faulty element) or white (a non faulty element). Consider now the repetitive process where each node recolors itself, at each local time step, with the color held by the majority of its neighbors. Depending on the initial assignment of colors to the nodes and on the precise definition of majority, different dynamics can occur. \textit{Dynamos} are by definition initial assignments of colors which lead the system to a monochromatic configuration in a finite number of steps. The authors study two particular forms of dynamos (\textit{irreversible} and \textit{monotone}) in tori (in which each node has four neighbors), focusing on the minimum number of initial black elements needed to reach the fixed point. In \textit{reversible} coloring under \textit{simple} majority, each vertex becomes black if two of its neighbors are black, otherwise it becomes white. In \textit{reversible} coloring under \textit{strong} majority, if a vertex has three neighbors with the same color, it takes this color, otherwise it does not change its color. In \textit{irreversible} coloring under \textit{simple} majority a vertex becomes black if it has two black neighbors, otherwise it does not change its color. And in \textit{irreversible} coloring under \textit{strong} majority a vertex becomes black if it has three black neighbors, otherwise it does not change. An initial set \(S\) of black vertices is an irreversible dynamo under simple (respectively, strong) majority if an all black configuration is reached from \(S\) in a finite number of steps under the irreversible simple (respectively, strong) majority rule. For brevity, we call \(S\) a \textit{simple} (respectively, \textit{strong}) \textit{irreversible dynamo}. Similarly, a \textit{simple} (respectively, \textit{strong}) \textit{monotone dynamo} is an initial set of black vertices from which an all black configuration is reached in a finite number of steps under the reversible simple (respectively, strong) majority rule, and such that no black vertex ever becomes white during the process. Lower and upper bounds on the size of dynamos for three types of tori are derived, under simple and strong majority rule. These bounds are tight within an additive constant. In addition, the upper bounds are constructive: for each topology and each majority rule the authors exhibit a dynamo of the claimed size.