Skip navigation
Skip navigation

Convergence of periodic gossiping algorithms

Anderson, Brian; Yu, Changbin (Brad); Morse, A Stephen


In deterministic gossiping, pairs of nodes in a network holding in general different values of a variable share information with each other and set the new value of the variable at each node to the average of the previous values. This occurs by cycling, sometimes periodically, through a designated sequence of nodes. There is an associated undirected graph, whose vertices are defined by the nodes and whose edges are defined by the node pairs which gossip over the cycle. Provided this graph is...[Show more]

CollectionsANU Research Publications
Date published: 2010
Type: Journal article
Source: Lecture Notes in Control and Information Sciences: Control of Uncertain Systems: Modelling, Approximation, and Design
DOI: 10.1007/978-3-540-93918-4_12


File Description SizeFormat Image
01_Anderson_Convergence_of_periodic_2010.pdf243.2 kBAdobe PDF    Request a copy

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

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator