Skip to Main Content
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.
Date of Publication: Feb. 2011