On the convergence time of asynchronous distributed quantized averaging algorithms

Details On the convergence time of asynchronous distributed quantized averaging algorithms On the convergence time of asynchronous distributed quantized averaging algorithms

2010-02-10

arxiv.org/abs/1002.2246v1

Mathematics

Optimization and Control

16 pages, no figure

Scientific paper

We come up with a class of distributed quantized averaging algorithms on asynchronous communication networks with fixed, switching and random topologies. The implementation of these algorithms is subject to the realistic constraint that the communication rate, the memory capacities of agents and the computation precision are finite. The focus of this paper is on the study of the convergence time of the proposed quantized averaging algorithms. By appealing to random walks on graphs, we derive polynomial bounds on the expected convergence time of the algorithms presented.

Affiliated with

Also associated with

No associations

Rating

On the convergence time of asynchronous distributed quantized averaging algorithms 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 On the convergence time of asynchronous distributed quantized averaging algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the convergence time of asynchronous distributed quantized averaging algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-67816