On the Convergence Time of Asynchronous Distributed Quantized Averaging Algorithms

By Minghui Zhu, Sonia Martínez. 2010

53 citations recorded by the source corpus.

We introduce here a class of distributed quantized averaging algorithms for asynchronous communication networks with fixed and switching topologies. The focus of this technical note 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, as a function of the number of agents in the network.

Subfields: Computer Networks and Communications

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Ji Liu
2. Tamer Basar
3. Mahmoud El Chamie
4. Amirhossein Reisizadeh
5. Aryan Mokhtari
6. Ramtin Pedarsani

Citations in the corpus

• Design and analysis of distributed averaging with quantized communication (2014, methodology): “Stochastic quantized gossip algorithms were introduced in [20], [31] and shown to work properly.”