On the Convergence Time of Asynchronous Distributed Quantized Averaging Algorithms

@article{Zhu2011OnTC,
  title={On the Convergence Time of Asynchronous Distributed Quantized Averaging Algorithms},
  author={Minghui Zhu and Sonia Mart{\'i}nez},
  journal={IEEE Transactions on Automatic Control},
  year={2011},
  volume={56},
  pages={386-390}
}
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. 

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 17 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-6 OF 6 REFERENCES

Winkler,Maximum hitting time for random walks on graphs

  • P. G. Brightwell
  • Random Structures and Algorithms,
  • 1990
Highly Influential
4 Excerpts

Mart́ ınez,On the convergence time of distributed quantized averaging algorithms

  • S. M. Zhu
  • Proceedings of the 47th IEEE Conference on…
  • 2008

Similar Papers

Loading similar papers…