Convergence of periodic gossiping algorithms
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]
|Collections||ANU Research Publications|
|Source:||Lecture Notes in Control and Information Sciences: Control of Uncertain Systems: Modelling, Approximation, and Design|
|01_Anderson_Convergence_of_periodic_2010.pdf||243.2 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.