Convergence time analysis of quantized gossip consensus on digraphs
Kai Cai, Hideaki Ishii
Automatica, vol. 48, no. 9, pp. 2344-2351, Sep. 2012
Keywords: Quantized consensus, average consensus, convergence time, randomized gossip algorithms, Markov chains
Abstract: We have recently proposed quantized gossip algorithms which solve the consensus and averaging problems on directed graphs with the least restrictive connectivity requirements. In this paper we study the convergence time of these algorithms. To this end, we investigate the shrinking time of the smallest interval that contains all states for the consensus algorithm, and the decay time of a suitable Lyapunov function for the averaging algorithm. The investigation leads us to characterize the convergence time by the hitting time in certain special Markov chains. We simplify the structures of state transition by considering the special case of complete graphs, where every edge can be activated with an equal probability, and derive polynomial upper bounds on convergence time.
Disclaimer: This material is posted for timely dissemination of scholarly work. Copyright is retained by authors and the publisher.