Agreement over random networks

IEEE Transactions on Automatic Control

Volumn 50, Issue 11, 2005, Pages 1867-1872

  Hatano, Yuko ^a   Mesbahi, Mehran ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

Agreement problem; Networked systems; Random graphs; Stochastic stability; Supermartingales

Indexed keywords

ASYMPTOTIC STABILITY; COMMUNICATION CHANNELS (INFORMATION THEORY); CONVERGENCE OF NUMERICAL METHODS; GRAPH THEORY; RANDOM PROCESSES; SYSTEM STABILITY; THEOREM PROVING; TOPOLOGY;

AGREEMENT PROBLEM; NETWORKED SYSTEMS; RANDOM GRAPHS; RANDOM NETWORKS; STOCHASTIC STABILITY; SUPERMARTINGALES;

NETWORK PROTOCOLS;

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

References (26)

1. A. Berman and R. Plemmons, Nonnegative Matrices in the Mathematical Sciences. Philadelphia, PA: SIAM, 1994.
2. B. Bollobás, Random Graphs. Cambridge, U.K.: Cambridge Univ. Press, 2001.
3. F. Chung, L. Lu, and V. Vu, "The spectra of random graphs with given expected degrees," in Proc. Nal. Acad. Sci., vol. 100, 2003, pp. 6313-6318.
4. R. Diestel, Graph Theory. New York: Springer-Verlag, 2000.
5. P. Erdós and A. Rényi, "On the evolution of random graphs," Pub. Math. Inst. Hung. Acad. Sci., no. 5, pp. 17-61, 1960.
6. A. Fax and R. M. Murray, "Information flow and cooperative control of vehicle formations," IEEE Trans. Autom. Control, vol. 49, no. 9, pp. 1465-1476, Sep. 2004.
7. M. Fiedler, "Algebraic connectivity of graphs," Czech. Math. J., vol. 23, no. 98, pp. 298-305, 1973.
8. D. Freedman, Markov Chains. New York: Springer-Verlag, 1983.
9. C. Godsil and G. Royle, Algebraic Graph Theory. New York: Springer- Verlag, 2001.
10. A. Jadbabaie, J. Lin, and A. S. Morse, "Coordination of groups of mobile autonomous agents using nearest neighbor rules," IEEE Trans. Autom. Control, vol. 48, no. 6, pp. 988-1001, Jun. 2003.
11. S. Janson, T. Luczak, and A. Ruciński, Random Graphs. New York: Wiley, 2000.
12. Z. Lin, M. Broucke, and B. Francis, "Local control strategies for groups of mobile autonomous agents," IEEE Trans. Autom. Control, vol. 49, no. 4, pp. 622-629, Apr. 2004.
13. M. Juvan and B. Mohar, "Laplacian eigenvalues and bandwidth-type invariants of graphs," J. Graph Theory, no. 17, pp. 393-407, 1993.
14. H. J. Kushner, Stochastic Stability and Control. Norwell, MA: Academic, 1967.
15. H. J. Kushner, Introduction to Stochastic Control. New York: Holt, Reinhart, and Winston, 1971.
16. M. Mesbahi, "On a dynamic extension of the theory of graphs," in Proc. Amer. Control Conf., May 2002, pp. 1234-1239.
17. M. Mesbahi, "State-dependent graphs and their controllability properties," IEEE Trans. Autom. Control, vol. 50, no. 3, pp. 387-392, Mar. 2005.
18. B. Mohar et al., "Eigenvalues in combinatorial optimization " in Combinatorial and Graph-Theoretical Problems in Linear Algebra, R. Brualdi et al., Eds. New York: Springer-Verlag, 1993.
19. L. Moreau, "Stability of multiagent systems with time-dependent communication links," IEEE Trans. Autom. Control, vol. 50, no. 2, pp. 169-182, Feb. 2005.
20. R. Olfati-Saber and R. M. Murray, "Consensus problems in networks of agents with switching topology and time-delays," IEEE Trans. Autom. Control, vol. 49, no. 9, pp. 1520-1533, Sep. 2004.
21. R. Olfati-Saber, "Ultrafast consensus in small-world networks," in Proc. Amer. Control Conf., Jun. 2005, pp. 2372-2378.
22. M. Penrose, Random Geometric Graphs. Oxford, U.K.: Oxford Univ. Press, 2003.
23. D. J. Watts and S. H. Strogatz, "Collective dynamics of "small-world" networks," Nature, vol. 393, pp. 440-442, Jun. 1998.
24. L. Xiao and S. Boyd, "Fast linear iterations for distributed averaging," Syst. Control Lett., vol. 53, pp. 65-78, 2004.
25. F. Xue and P. R. Kumar, "The number of neighbors needed for connectivity of wireless networks," Wireless Networks, no. 10, pp. 169-181, 2004.
26. [Online]. Available: http://planetquest.jpl.nasa.gov/TPF/