Periodic Gossiping

Gossiping is a well-studied distributed algorithm whose purpose is to enable the members of a group of autonomous agents to asymptotically determine in a decentralized manner, the average of their initial scalar-valued gossip variables. T -periodic gossiping is a gossiping protocol which stipulates that each agent must gossip with each of its neighbors exactly once every T time unit. Under suitable connectivity assumptions of a graph characterizing all allowable gossip pairs, a T -periodic gossip sequence will converge at a rate determined by the magnitude of the second largest eigenvalue of the stochastic matrix determined by the sequence of gossips which occurs over a period. It has been shown in the prior work that if the underlying graph of allowable gossips is a tree, this eigenvalue is the same for all possible T -periodic gossip sequences. The aim of this paper is to develop several properties for stochastic matrices induced by the sequence of gossips occurring over a T period and reprove the result using these properties in a different and simpler argument.

[1]  N. Jacobson,et al.  Basic Algebra I , 1976 .

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

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

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

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

[6]  E.M. Atkins,et al.  A survey of consensus problems in multi-agent coordination , 2005, Proceedings of the 2005, American Control Conference, 2005..

[7]  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.

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

[9]  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..

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

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

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

[13]  Sandro Zampieri,et al.  Randomized consensus algorithms over large scale networks , 2007 .

[14]  Reza Olfati-Saber,et al.  Consensus and Cooperation in Networked Multi-Agent Systems , 2007, Proceedings of the IEEE.

[15]  Anand D. Sarwate,et al.  Broadcast Gossip Algorithms for Consensus , 2009, IEEE Transactions on Signal Processing.

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

[17]  Panganamala Ramana Kumar,et al.  Fundamentals of Large Sensor Networks: Connectivity, Capacity, Clocks, and Computation , 2009, Proceedings of the IEEE.

[18]  Soummya Kar,et al.  Gossip Algorithms for Distributed Signal Processing , 2010, Proceedings of the IEEE.

[19]  Shaoshuai Mou,et al.  Deterministic gossiping with a periodic protocol , 2010, 49th IEEE Conference on Decision and Control (CDC).

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

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