Fast convergence of quantized consensus using Metropolis chains

We consider the quantized consensus problem on undirected connected graphs and study its expected convergence time to the set of consensus points. As compared with earlier results on the problem, we improve the convergence speed of the dynamics by a factor of n, where n is the number of agents involved in the dynamics. In particular, we show that when the edges of the network are activated based on a Poisson processes with Metropolis rates, the expected convergence time to the consensus set is at most O(n2 log n). This upper bound is better than all available results for randomized quantized consensus.

[1]  John N. Tsitsiklis,et al.  Distributed asynchronous deterministic and stochastic gradient optimization algorithms , 1986 .

[2]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[3]  David J. Aldous,et al.  Lower bounds for covering times for reversible Markov chains and random walks on graphs , 1989 .

[4]  M. Karonski.  Collisions among Random Walks on a Graph , 1993 .

[5]  S. Muthukrishnan,et al.  Dynamic load balancing in parallel and distributed networks by random matchings (extended abstract) , 1994, SPAA '94.

[6]  Bhaskar Ghosh,et al.  Dynamic load balancing on parallel and distributed networks by random matchings , 1994 .

[7]  Robert G. Gallager,et al.  Discrete Stochastic Processes , 1995 .

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

[9]  Robert Nowak,et al.  Distributed optimization in sensor networks , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

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

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

[12]  Francesco Bullo,et al.  Notes on averaging over acyclic digraphs and discrete coverage control , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[13]  J. Pearl,et al.  Random geometric graphs: an algorithmic perspective , 2006 .

[14]  R. Srikant,et al.  Quantized Consensus , 2006, 2006 IEEE International Symposium on Information Theory.

[15]  Stephen P. Boyd,et al.  Distributed average consensus with least-mean-square deviation , 2007, J. Parallel Distributed Comput..

[16]  J. K. Hunter,et al.  Measure Theory , 2007 .

[17]  E. Seneta.  Non-negative Matrices and Markov Chains , 2008 .

[18]  Elizabeth L. Wilmer,et al.  Markov Chains and Mixing Times , 2008 .

[19]  Ruggero Carli,et al.  Quantized average consensus via dynamic coding/decoding schemes , 2008, 2008 47th IEEE Conference on Decision and Control.

[20]  Randal W. Beard,et al.  Distributed Consensus in Multi-vehicle Cooperative Control - Theory and Applications , 2007, Communications and Control Engineering.

[21]  Angelia Nedic,et al.  Distributed Non-Autonomous Power Control through Distributed Convex Optimization , 2009, IEEE INFOCOM 2009.

[22]  Asuman E. Ozdaglar,et al.  Distributed Subgradient Methods for Multi-Agent Optimization , 2009, IEEE Transactions on Automatic Control.

[23]  Giovanni Neglia,et al.  Distributed gradient optimization for epidemic routing: A preliminary evaluation , 2009, 2009 2nd IFIP Wireless Days (WD).

[24]  Martin Vetterli,et al.  Interval consensus: From quantized gossip to voting , 2009, 2009 IEEE International Conference on Acoustics, Speech and Signal Processing.

[25]  Ruggero Carli,et al.  Gossip consensus algorithms via quantized communication , 2009, Autom..

[26]  Moez Draief,et al.  Convergence Speed of Binary Interval Consensus , 2010, 2010 Proceedings IEEE INFOCOM.

[27]  Alexander Olshevsky,et al.  Efficient information aggregation strategies for distributed control and signal processing , 2010, 1009.6036.

[28]  Kunihiko Sadakane,et al.  The hitting and cover times of Metropolis walks , 2010, Theor. Comput. Sci..

[29]  Kai Cai,et al.  Quantized Consensus and Averaging on Gossip Digraphs , 2011, IEEE Transactions on Automatic Control.

[30]  Sonia Martínez,et al.  On the Convergence Time of Asynchronous Distributed Quantized Averaging Algorithms , 2010, IEEE Transactions on Automatic Control.

[31]  John N. Tsitsiklis,et al.  Distributed Anonymous Discrete Function Computation , 2010, IEEE Transactions on Automatic Control.

[32]  Kai Cai,et al.  Convergence time analysis of quantized gossip consensus on digraphs , 2011, Autom..

[33]  Sanjeev R. Kulkarni,et al.  An upper bound on the convergence time for distributed binary consensus , 2012, 2012 15th International Conference on Information Fusion.

[34]  Javad Lavaei,et al.  Quantized Consensus by Means of Gossip Algorithm , 2012, IEEE Transactions on Automatic Control.

[35]  Lihua Xie,et al.  Distributed Coordination of Multi-Agent Systems With Quantized-Observer Based Encoding-Decoding , 2012, IEEE Transactions on Automatic Control.

[36]  V. Climenhaga.  Markov chains and mixing times , 2013 .

[37]  Alexander Olshevsky.  Consensus with ternary messages , 2013, 52nd IEEE Conference on Decision and Control.

[38]  Dimos V. Dimarogonas,et al.  Consensus with quantized relative state measurements , 2013, Autom..

[39]  Sanjeev R. Kulkarni,et al.  An upper bound on the convergence time for quantized consensus , 2013, INFOCOM.

[40]  Tamer Basar,et al.  Convergence time for unbiased quantized consensus , 2013, 52nd IEEE Conference on Decision and Control.

[41]  Alex Olshevsky,et al.  Linear Time Average Consensus on Fixed Graphs and Implications for Decentralized Optimization and Multi-Agent Control , 2014, 1411.4186.

[42]  Francesco Bullo,et al.  Consensus networks over finite fields , 2013, Autom..

[43]  Tamer Basar,et al.  Convergence Time for Unbiased Quantized Consensus Over Static and Dynamic Networks , 2014, IEEE Transactions on Automatic Control.