A necessary and sufficient condition for consensus over random networks

IEEE Transactions on Automatic Control

Volumn 53, Issue 3, 2008, Pages 791-795

  Tahbaz Salehi, Alireza ^a   Jadbabaie, Ali ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Consensus problem; Random graphs; Tail events; Weak ergodicity

Indexed keywords

DISCRETE TIME CONTROL SYSTEMS; GRAPH THEORY; PROBABILITY; STOCHASTIC CONTROL SYSTEMS;

CONSENSUS PROBLEM; RANDOM GRAPHS; TAIL EVENTS;

DYNAMICAL SYSTEMS;

EID: 42649100996     PISSN: 00189286     EISSN: None     Source Type: Journal    
DOI: 10.1109/TAC.2008.917743     Document Type: Article

References (20)

1. M. H. DeGroot, "Reaching a consensus," J. Am. Statistical Assoc. vol. 69, no. 345, pp. 118-121, Mar 1974.
2. S. Chatterjee and E. Seneta, "Towards consensus: Some convergence theorems on repeated averaging," J. Appl. Probab., vol. 14, no. 1, pp. 89-97, Mar. 1977.
3. J. N. Tsitsiklis, "Problems in decentralized decision making and computation," Ph. D, dissertation, Massachusetts Inst. Technol., Cambridge, MA, 1984.
4. J. N. Tsitsiklis, D. R Bertsekas, and M. Athans, "Distributed asynchronous deterministic and stochastic gradient optimization algorithms," IEEE Trans. Autom. Control, vol. 31, no. 9, pp. 803-812, Sep. 1986.
5. A. Jadbabaie, J. Lin, and A. S. Morse, "Coordination of groups of mobile autonomous agents using nearest neighbor rules," IEEE Trans. Autom. Control, vol. 488, no. 6, pp. 988-1001, Jun. 2003.
6. V. D. Blondel, J. M. Hendrickx, A. Olshevsky, and J. N. Tsitsklis, "Convergence in multiagent coordination, consensus, and flocking," in Proc. Joint 44th IEEE Cont. Decision Control Eur. Control Conf., Seville, Spain, Dec. 2005, pp. 2996-3000.
7. S. Boyd, A. Gosh, B. Prabhakar, and D. Shah, "Gossip algorithms: Design, analysis and applications," in Proc. IEEE INFOCOM 2005, vol. 3, Miami, FL, Mar. 2005, pp. 1653-1664.
8. L. Xiao, S. Boyd, and S. Lall, "A scheme for robust distributed sensor fusion based on average consensus," in Proc. 4th Int. Conf. Inf. Process. Sensor Netw., Apr., Apr. 2005, pp. 63-70.
9. R. Olfati-Saber and R. M. Murray, "Consensus problems in networks of agents with switching topology and time delays," IEEE Trans. Automatix Control, vol. 49, no. 9, pp. 1520-1533, Sep. 2004.
10. J. Cortes, S. Martinez, and F. Bullo, "Robust rendezvous for mobile autonomous agents via proximity graphs in arbitrary dimensions," IEEE Trans. Autom. Control, vol. 51, no. 8, pp. 1289-1298, Aug. 2006.
11. Y. Hatano and M. Mesbahi, "Agreement over random networks," IEEE Trans. Autom. Control, vol. 50, no. 11, pp. 1867-1872, Nov. 2005.
12. C. W. Wu, "Synchronization and convergence of linear dynamics in random directed networks," Trans. Autom. Control, vol. 51, no. 7, pp. 1207-1210, Jul. 2006.
13. R. Cogburn, "The ergodic theory of Markov chains in random environments," Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, vol. 66, no. 1, pp. 109-128, 1984.
14. R. Cogburn, "On products of random stochastic matrices," in Proc. Am. Math. Soc. Summer Res. Conf. Random Matrices Appl., vol. 50, Providence, RI, 1986, pp. 199-213.
15. D. Griffeath, "A maximal coupling for Markov chains." Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, vol. 31, no. 2, pp. 95-106, 1975.
16. R. L. Dobrushin, "Central limit theorem for non-stationary Markov chains, I, II," Theory Probab. Appl., vol. 1, pp. 65-80, 329-383, 1956, (English Translation).
17. R. Durrett, Probability: Theory and Examples, 3rd ed. Belmont, CA: Duxbury Press, 2005.
18. E. Seneta, Non-Negative Matrices and Markov Chains, 2nd ed. New York: Springer-Verlag, 1981.
19. A. Berman and R. J. Plemmons, Nonnegative Matrices in the Mathematical Sciences. New York: Academic, 1979.
20. S. Boyd, A. Gosh, B. Prabhakar, and D. Shah, "Randomized gossip algorithms," Special Issue IEEE Trans. Inf. Theory IEEE/ACM Trans. Netw., vol. 52, no. 6. pp. 2508-2530, Jun. 2006.