Almost sure exponential convergence to consensus of random gossip algorithms

SUMMARY In this paper, we provide a proof of almost sure exponential convergence to consensus for a general class of ergodic edge selection processes. The proof is based on the multiplicative ergodic theorem of Oseledec and also applies to continuous time gossip algorithms. An example of exponential convergence in a non ergodic case is also discussed. Copyright © 2012 John Wiley & Sons, Ltd.

[1]  T. Morrison,et al.  Dynamical Systems , 2021, Nature.

[2]  B. D. Finetti.  La prévision : ses lois logiques, ses sources subjectives , 1937 .

[3]  D. Aldous.  Exchangeability and related topics , 1985 .

[4]  R. Cogburn,et al.  ON DIRECT CONVERGENCE AND PERIODICITY FOR TRANSITION PROBABILITIES OF MARKOV CHAINS IN RANDOM ENVIRONMENTS , 1990 .

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

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

[7]  Jon M. Kleinberg,et al.  Spatial gossip and resource location protocols , 2004, J. ACM.

[8]  Alireza Tahbaz-Salehi,et al.  On consensus over random networks , 2006 .

[9]  Steven Orey,et al.  Markov Chains with Stochastically Stationary Transition Probabilities , 1991 .

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

[11]  Gene H. Golub,et al.  Matrix computations , 1983 .

[12]  M. Neumann,et al.  Generalizations of the projection method with applications to SOR theory for hermitian positive semidefinite linear systems , 1987 .

[13]  L. Elsner,et al.  On the convergence of asynchronous paracontractions with application to tomographic reconstruction from incomplete data , 1990 .

[14]  J. Wolfowitz.  Products of indecomposable, aperiodic, stochastic matrices , 1963 .

[15]  S. V. Fomin,et al.  Ergodic Theory , 1982 .

[16]  A. Bensoussan,et al.  Difference equations on weighted graphs , 2005 .

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

[18]  Dirk A. Lorenz,et al.  On Conditions for Convergence to Consensus , 2008, IEEE Transactions on Automatic Control.

[19]  École d'été de probabilités de Saint-Flour,et al.  École d'été de probabilités de Saint-Flour XIII - 1983 , 1985 .

[20]  Giorgio Picci,et al.  Almost sure convergence of random gossip algorithms , 2007, 2007 46th IEEE Conference on Decision and Control.

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

[22]  L. Arnold.  Random Dynamical Systems , 2003 .

[23]  D. Ruelle.  Ergodic theory of differentiable dynamical systems , 1979 .

[24]  David Ruelle.  Differentiable Dynamical Systems , 1989 .

[25]  Alireza Tahbaz-Salehi,et al.  Consensus Over Ergodic Stationary Graph Processes , 2010, IEEE Transactions on Automatic Control.

[26]  Sandro Zampieri,et al.  Randomized consensus algorithms over large scale networks , 2007, 2007 Information Theory and Applications Workshop.

[27]  V. I. Oseledec.  A multiplicative ergodic theorem: Lyapunov characteristic num-bers for dynamical systems , 1968 .

[28]  R. Cogburn.  The ergodic theory of Markov chains in random environments , 1984 .