Convergence Time Analysis of Quantized Gossip Consensus on Digraphs

Details Convergence Time Analysis of Quantized Gossip Consensus on Digraphs Convergence Time Analysis of Quantized Gossip Consensus on Digraphs

2011-05-09

arxiv.org/abs/1105.1668v1

Computer Science

Systems and Control

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Convergence Time Analysis of Quantized Gossip Consensus on Digraphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Convergence Time Analysis of Quantized Gossip Consensus on Digraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Convergence Time Analysis of Quantized Gossip Consensus on Digraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-334044