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

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

Cite this

Almost sure exponential convergence to consensus of random gossip algorithms. / Picci, Giorgio; Taylor, Thomas.

In: International Journal of Robust and Nonlinear Control, Vol. 23, No. 9, 06.2013, p. 1033-1045.

Research output: Contribution to journalArticle

@article{5da8a852212f4a83afb021953cd98f29,
title = "Almost sure exponential convergence to consensus of random gossip algorithms",
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.",
keywords = "consensus, multiplicative ergodic theorem",
author = "Giorgio Picci and Thomas Taylor",
year = "2013",
month = "6",
doi = "10.1002/rnc.2844",
language = "English (US)",
volume = "23",
pages = "1033--1045",
journal = "International Journal of Robust and Nonlinear Control",
issn = "1049-8923",
publisher = "John Wiley and Sons Ltd",
number = "9",

}

TY - JOUR

T1 - Almost sure exponential convergence to consensus of random gossip algorithms

AU - Picci, Giorgio

AU - Taylor, Thomas

PY - 2013/6

Y1 - 2013/6

N2 - 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.

AB - 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.

KW - consensus

KW - multiplicative ergodic theorem

UR - http://www.scopus.com/inward/record.url?scp=84876794055&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84876794055&partnerID=8YFLogxK

U2 - 10.1002/rnc.2844

DO - 10.1002/rnc.2844

M3 - Article

VL - 23

SP - 1033

EP - 1045

JO - International Journal of Robust and Nonlinear Control

JF - International Journal of Robust and Nonlinear Control

SN - 1049-8923

IS - 9

ER -