Skip navigation
Skip navigation

Analysis of accelerated gossip algorithms

Liu, Ji; Anderson, Brian; Cao, Ming; Morse, A Stephen


Gossiping is a distributed process whose purpose is to enable the members of a group of n>1 autonomous agents to asymptotically determine in a decentralized manner, the average of the initial values of their scalar gossip variables. This paper analyzes the accelerated gossip algorithms, first proposed in Cao, Spielman, and Yeh (2006), in which local memory is exploited by installing shift-registers at each agent. For the two-register case, the existence of the desired convergence is established...[Show more]

CollectionsANU Research Publications
Date published: 2013
Type: Journal article
Source: Automatica
DOI: 10.1016/j.automatica.2013.01.001


File Description SizeFormat Image
01_Liu_Analysis_of_accelerated_gossip_2013.pdf2.34 MBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  22 January 2019/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator