Weighted gossip: Distributed averaging using non-doubly stochastic matrices

This paper presents a general class of gossip-based averaging algorithms, which are inspired from Uniform Gossip. While Uniform Gossip works synchronously on complete graphs, weighted gossip algorithms allow asynchronous rounds and converge on any connected, directed or undirected graph. Unlike most...

Full description

Bibliographic Details
Main Authors: Tsitsiklis, John N., Benezit, Florence, Blondel, Vincent D., Thiran, Patrick, Vetterli, Martin
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Format: Article
Language:en_US
Published: Institute of Electrical and Electronics Engineers (IEEE) 2012
Online Access:http://hdl.handle.net/1721.1/73148
https://orcid.org/0000-0003-2658-8239