When infinite flow is sufficient for ergodicity

Proceedings of the IEEE Conference on Decision and Control

Volumn , Issue , 2010, Pages 7479-7486

  Touri, Behrouz ^a   Nedić, Angelia ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

Borel Cantelli lemma; Ergodicity, product of random stochastic matrices; Gossip algorithm; Linear random model; Link failure

Indexed keywords

DIGITAL CONTROL SYSTEMS; DISCRETE TIME CONTROL SYSTEMS; GRAPH ALGORITHMS; MATRIX ALGEBRA; STOCHASTIC SYSTEMS;

BOREL-CANTELLI LEMMA; GOSSIP ALGORITHMS; LINK FAILURES; RANDOM MODEL; STOCHASTIC MATRICES;

STOCHASTIC MODELS;

EID: 79953131935     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/CDC.2010.5717769     Document Type: Conference Paper

References (19)

1. T.C. Aysal, M.E. Yildriz, A. D. Sarwate, and A. Scaglione, Broadcast gossip algorithms for consensus, IEEE Transactions on Signal processing 57 (2009), 2748-2761.
2. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, Gossip algorithms: Design, analysis, and applications, Proceedings IEEE Infocom, 2005, pp. 1653-1664.
3. - Randomized gossip algorithms, IEEE Transactions on Information Theory 52 (2006), no. 6, 2508-2530.
4. S. Chatterjee and E. Seneta, Towards consensus: Some convergence theorems on repeated averaging, Journal of Applied Probability 14 (1977), no. 1, 89-97.
5. F. Chung and L. Lu, Complex graphs and networks, American Mathematical Society, Providence, Rhode Island, USA, 2006.
6. R. Cogburn, On products of random stochastic matrices, In Random matrices and their applications (1986), 199-213.
7. R. Durrett, Probability: Theory and examples, third ed., Curt Hinrichs, 2005.
8. F. Fagnani and S. Zampieri, Randomized consensus algorithms over large scale networks, IEEE Journal on Selected Areas in Communications 26 (2008), no. 4, 634-649. (Pubitemid 351658779)
9. I. Lobel and A. Ozdaglar, Distributed subgradient methods over random networks, Tech. report, Laboratory for Information and Decision Systems, Report 2800, MIT, 2008.
10. K. Nawrotzki, Discrete open systems on markov chains in a random environment. I, Elektronische Informationsverarbeitung und Kybernetik 17 (1981), 569-599.
11. - Discrete open systems on markov chains in a random environment. II, Elektronische Informationsverarbeitung und Kybernetik 18 (1982), 83-98.
12. A. Nedić, A. Olshevsky, A. Ozdaglar, and J.N. Tsitsiklis, On distributed averaging algorithms and quantization effects, to appear in IEEE Transactions on Automatic Control, 2009.
13. A. Olshevsky and J.N. Tsitsiklis, Convergence speed in distributed consensus and averaging, SIAM Journal on Control and Optimization 48 (2008), no. 1, 33-55.
14. M. Rosenblatt, Products of independent identically distributed stochastic matrices, Journal of Journal of Mathematical Analysis and Applications 11 (1965), no. 1, 1-10.
15. A. Tahbaz-Salehi and A. Jadbabaie, A necessary and sufficient condition for consensus over random networks, IEEE Transactions on Automatic Control 53 (2008), no. 3, 791-795.
16. - Consensus over ergodic stationary graph processes, to appear in IEEE Transactions on Automatic Control, 2009.
17. B. Touri and A. Nedić, On ergodicity, infinite flow and consensus in random models, available at http://arxiv.org/abs/1001.1890.
18. J.N. Tsitsiklis, Problems in decentralized decision making and computation, Ph.D. thesis, Dept. of Electrical Engineering and Computer Science, MIT, 1984.
19. J.N. Tsitsiklis, D.P. Bertsekas, and M. Athans, Distributed asynchronous deterministic and stochastic gradient optimization algorithms, IEEE Transactions on Automatic Control 31 (1986), no. 9, 803-812. (Pubitemid 16629805)