Ricerc@Sapienza

Given an underlying graph, we consider the following dynamics: Initially, each node locally chooses a value in { - 1, 1}, uniformly at random and independently of other nodes. Then, in each consecutive round, every node updates its local value to the average of the values held by its neighbors, at the same time applying an elementary, local clustering rule that only depends on the current and the previous values held by the node.