论文信息 - Almost sure convergence of random gossip algorithms

Almost sure convergence of random gossip algorithms

In this paper we provide a proof of almost sure convergence to consensus for an extremely general class of edge selection processes. The proof also applies to continuous time gossip algorithms.

Giorgio Picci | Thomas Taylor | G. Picci | T. Taylor

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

[2] C. Caramanis. What is ergodic theory , 1963 .

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

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

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

[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] L. Elsner,et al. On the convergence of asynchronous paracontractions with application to tomographic reconstruction from incomplete data , 1990 .

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

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

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

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

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

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

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

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