@inproceedings{117061466fa04c5587d4bc5ab545bcce,
title = "An upper bound on the convergence time for distributed binary consensus",
abstract = "The problem addressed in this paper is the analysis of a distributed consensus algorithm for arbitrary networks, proposed by B{\'e}n{\'e}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(N4 log N) upper bound for the expected convergence time on an arbitrary graph of size N.",
keywords = "Distributed binary consensus, convergence time, gossip",
author = "Shang Shang and Cuff, \{Paul W.\} and Kulkarni, \{Sanjeev R.\} and Pan Hui",
year = "2012",
language = "English (US)",
isbn = "9780982443859",
series = "15th International Conference on Information Fusion, FUSION 2012",
publisher = "IEEE Computer Society",
pages = "369--375",
booktitle = "15th International Conference on Information Fusion, FUSION 2012",
address = "United States",
note = "15th International Conference on Information Fusion, FUSION 2012 ; Conference date: 07-09-2012 Through 12-09-2012",
}