Before revision:  We  show that the probability of success of the first algorithm goes to one as the percentage of nodes choosing the majority vote as their initial values gets close to one.
After revision:  We establish theoretical guarantees for the convergence of these algorithms. In particular, we show that the probability of success of the first algorithm goes to one as the percentage of nodes choosing the majority vote as their initial values gets close to one.