An upper bound on the convergence time for distributed binary consensus

The problem addressed in this paper is the analysis of a distributed consensus algorithm for arbitrary networks, proposed by Bénézit et al. In the initial setting, each node in the network has one of two possible states (“yes” or “no”). Nodes can update their states by communicating with their neighbors via a 2-bit message in an asynchronous clock setting. Eventually, all nodes reach consensus on the majority states. We use the theory of electric networks, random walks, and couplings of Markov chains to derive an O(N
⁴
log N) upper bound for the expected convergence time on an arbitrary graph of size N.