Skip to main content
Article thumbnail
Location of Repository

Convergence Time Analysis of Quantized Gossip Consensus on Digraphs

By Kai Cai and Hideaki Ishii

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 characterizing 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

Topics: Computer Science - Systems and Control, Mathematics - Dynamical Systems
Year: 2011
OAI identifier: oai:arXiv.org:1105.1668
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://arxiv.org/abs/1105.1668 (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.