Abstract

In this paper, we provide a proof of almost sure exponential convergence to consensus for a general class of ergodic edge selection processes. The proof is based on the multiplicative ergodic theorem of Oseledec and also applies to continuous time gossip algorithms. An example of exponential convergence in a non ergodic case is also discussed.

Original languageEnglish (US)
Pages (from-to)1033-1045
Number of pages13
JournalInternational Journal of Robust and Nonlinear Control
Volume23
Issue number9
DOIs
StatePublished - Jun 2013

Keywords

  • consensus
  • multiplicative ergodic theorem

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Chemical Engineering(all)
  • Biomedical Engineering
  • Aerospace Engineering
  • Mechanical Engineering
  • Industrial and Manufacturing Engineering
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Almost sure exponential convergence to consensus of random gossip algorithms'. Together they form a unique fingerprint.

Cite this