Convergence time for unbiased quantized consensus

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We revisit the quantized consensus problem on undirected connected graphs, and obtain some strong results on expected time to convergence. This is unbiased consensus, because the edges emanating from a node have equal probability of being selected. The paper first develops an approach that bounds the expected convergence time of the underlying discrete-time dynamics. The bounds are tight for some simple networks when there exists some symmetry in the network. Following this, the paper provides a tight expression for the expected convergence time of unbiased quantized consensus over general networks. Finally, the paper shows that the expected convergence time can be expressed in terms of the effective resistances of the associated Cartesian product graph. The approach adopted in the paper uses the theory of harmonic functions for reversible Markov chains.

Original languageEnglish (US)
Title of host publication2013 IEEE 52nd Annual Conference on Decision and Control, CDC 2013
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages6190-6195
Number of pages6
ISBN (Print)9781467357173
DOIs
StatePublished - 2013
Event52nd IEEE Conference on Decision and Control, CDC 2013 - Florence, Italy
Duration: Dec 10 2013Dec 13 2013

Publication series

NameProceedings of the IEEE Conference on Decision and Control
ISSN (Print)0743-1546
ISSN (Electronic)2576-2370

Other

Other52nd IEEE Conference on Decision and Control, CDC 2013
Country/TerritoryItaly
CityFlorence
Period12/10/1312/13/13

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Fingerprint

Dive into the research topics of 'Convergence time for unbiased quantized consensus'. Together they form a unique fingerprint.

Cite this