By Topic

Convergence time analysis of quantized gossip algorithms on digraphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kai Cai ; Dept. of Comput. Intell. & Syst. Sci., Tokyo Inst. of Technol., Yokohama, Japan ; Ishii, H.

We have recently proposed quantized gossip algorithms which solve the consensus and averaging problems on directed graphs. In this paper we focus on the convergence time of these algorithms; specifically, we provide upper bounds on the mean time taken for convergence on complete graphs, as functions of the number of nodes. 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, from which we derive polynomial upper bounds.

Published in:

Decision and Control (CDC), 2010 49th IEEE Conference on

Date of Conference:

15-17 Dec. 2010