Let G be a simple connected graph where every node is colored either black or white. Consider now the following repetitive process on G:eac h node recolors itself, at each local time step, with the color held
by the majority of its neighbors. Since the clocks are not necessarily synchronized, the process can be asynchronous.