Deterministic gossiping with a periodic protocol

A sequence of allowable gossips between pairs of agents in a group is complete if the gossip graph which the sequence generates is a connected spanning subgraph of the graph of all allowable gossip pairs; such a sequence is minimally complete if there is no shorter sequence which is complete. An infinite sequence of gossips is repetitively complete with period T if each successive subsequence of length T within the gossip sequence is complete. Any such sequence converges exponentially fast. A repetitively complete gossip sequence is periodic with period T if each gossip in the sequence is repeated once every T time steps. The rate of convergence of a periodic gossiping process is determined by the Tth root of the second largest eigenvalue in magnitude of the stochastic matrix of the complete gossip subsequence. In the case when the graph of allowable gossips is a tree and the complete gossip subsequence is minimally complete, this eigenvalue is independent of the order in which the gossips occur within the complete gossip subsequences.

[1]  Brian D. O. Anderson,et al.  Analysis of accelerated gossip algorithms , 2009, CDC.

[2]  Richard M. Murray,et al.  Consensus problems in networks of agents with switching topology and time-delays , 2004, IEEE Transactions on Automatic Control.

[3]  John N. Tsitsiklis,et al.  Convergence Speed in Distributed Consensus and Averaging , 2009, SIAM J. Control. Optim..

[4]  Randal W. Beard,et al.  Consensus seeking in multiagent systems under dynamically changing interaction topologies , 2005, IEEE Transactions on Automatic Control.

[5]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[6]  Luc Moreau,et al.  Stability of multiagent systems with time-dependent communication links , 2005, IEEE Transactions on Automatic Control.

[7]  Shaoshuai Mou,et al.  Deterministic Gossiping , 2011, Proceedings of the IEEE.

[8]  J.N. Tsitsiklis,et al.  Convergence Rates in Distributed Consensus and Averaging , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[9]  Daniel A. Spielman,et al.  Accelerated Gossip Algorithms for Distributed Computation , 2006 .

[10]  J.N. Tsitsiklis,et al.  Convergence in Multiagent Coordination, Consensus, and Flocking , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[11]  Stephen P. Boyd,et al.  Fast linear iterations for distributed averaging , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[12]  Stephen P. Boyd,et al.  Gossip algorithms: design, analysis and applications , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[13]  Brian D. O. Anderson,et al.  Convergence of Periodic Gossiping Algorithms , 2010 .

[14]  Jie Lin,et al.  Coordination of groups of mobile autonomous agents using nearest neighbor rules , 2003, IEEE Trans. Autom. Control..

[15]  M. Cao,et al.  A Lower Bound on Convergence of a Distributed Network Consensus Algorithm , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[16]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[17]  John N. Tsitsiklis,et al.  On distributed averaging algorithms and quantization effects , 2007, 2008 47th IEEE Conference on Decision and Control.

[18]  Stephen P. Boyd,et al.  Randomized gossip algorithms , 2006, IEEE Transactions on Information Theory.

[19]  B. Anderson,et al.  The Contraction Coefficient of a Complete Gossip Sequence , 2010 .