Almost sure convergence of random gossip algorithms

Giorgio Picci, Thomas Taylor

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

18 Scopus citations

Abstract

In this paper we provide a proof of almost sure convergence to consensus for an extremely general class of edge selection processes. The proof also applies to continuous time gossip algorithms.

Original languageEnglish (US)
Title of host publicationProceedings of the 46th IEEE Conference on Decision and Control 2007, CDC
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages282-287
Number of pages6
ISBN (Print)1424414989, 9781424414987
DOIs
StatePublished - 2007
Event46th IEEE Conference on Decision and Control 2007, CDC - New Orleans, LA, United States
Duration: Dec 12 2007Dec 14 2007

Publication series

NameProceedings of the IEEE Conference on Decision and Control

Other

Other46th IEEE Conference on Decision and Control 2007, CDC
Country/TerritoryUnited States
CityNew Orleans, LA
Period12/12/0712/14/07

ASJC Scopus subject areas

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

Fingerprint

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

Cite this