Average consensus over small world networks: A probabilistic framework

Proceedings of the IEEE Conference on Decision and Control

Volumn , Issue , 2008, Pages 375-380

  Hovareshti, Pedram ^a   Baras, John S ^a   Gupta, Vijay ^b  

^a UNIVERSITY OF MARYLAND   (United States)

^b University of Notre Dame   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH ALGORITHMS; SMALL-WORLD NETWORKS;

AVERAGE CONSENSUS; CONSENSUS ALGORITHMS; CONSENSUS PROBLEMS; GRAPH TOPOLOGY; PROBABILISTIC FRAMEWORK; PROBABILISTIC METHODS; RATE OF CONVERGENCE; SMALL WORLD GRAPHS;

TOPOLOGY;

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

References (29)

1. J.S. Baras and P. Hovareshti. Effects of graph topology on performance of distributed algorithms for networked control and sensing. Proceedings of the Workshop on Networked Distributed Systems for Intelligent Sensing and Control, Kalamata, Greece, (http://med.ee.nd.edu/), 2007.
2. V. Blondel, J. Hendrickx, A.Olshevsky, and J. Tsitsiklis. Convergence in multiagent coordination, consensus and flocking. Proc. of the 44th IEEE Conference on Decision and Control, pages 2996-3000, 2005.
3. B. Bollobas. Modern Graph Theory. Springer Verlag, 1998.
4. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. Randomized gossip algorithms. IEEE Transactions on Information Theory, 52(6):2508-2530, 2005.
5. R. Carli, F. Fagnani, A. Sperazon, and S.Zampieri. Communication constraints in the average consensus problem. Automatica, 44(3):671-684, 2008. Communication constraints in the average consensus problem
6. G. Cybenko. Dynamic load balancing for distributed memory multiprocessors. Journal on parallel and distributed computing, (7):279-301, 1989.
7. P. J. Davis. Circulant Matrices. Wiley, 1979.
8. M.P. Desai, and V.B. Rao. A new eigenvalue bound for reversible Markov chains with applications to the temperature-asymptotics of simulated annealing. Proceedings of the IEEE International Symposium on Circuits and Systems (2):1211-1214, 1990.
9. R. Durrett. Random Graph Dynamics. Cambridge Univ. Press, 2007.
10. F. Fagnani and S. Zampieri. Randomized consensus algorithms over large scale networks. submitted, 2007. available at http://calvino.polito.it/ fagnani/quantcontrol/Random
11. L. Fang and P. Antsaklis. On communication requirements for multi-agents consensus seeking. Proceedings of Workshop NESC05: University of Notre Dame, Lecture Notes in Control and Information Sciences (LNCIS), Springer, 331:53-68, 2006.
12. Y. Hanato and M. Mesbahi. Agreement over random networks. Proceedings of IEEE Conference on Decision and Control, 2004.
13. D. J. Hartfiel. Nonhomogeneous Matrix products. World Scientific, 2002.
14. D.J. Higham. A matrix perturbation view of the small world phenomenon. Siam Journal on Matrix Analysis and Applications, 25(2):429-444, 2003.
15. P. Hovareshti and J. S. Baras. Consensus problems on small world graphs: A structural study. Proc. of the 2006 International Conference on Complex Systems (ICCS2006), June 25-30, 2006, Boston, Mass.
16. P. Hovareshti and J.S. Baras and V. Gupta Average consensus over small world networks: Aprobabilistic framework. ISR Technical report, University of Maryland, available at http://www.lib.umd.edu/drum/handle/1903/4376.
17. A. Jadbabaie, J. Lin, and A. S. Morse. Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Transactions on Automatic Control, 48(6):988-1001, 2003.
18. T. Jiang and J. S. Baras. Autonomous trust establishment. Proceedings of the 2005 International Network Optimization Conference, Lisbon, Portugal, March 20-23, 2005.
19. M. Juvan and B. Mohar. Laplace eigenvalues and bandwidth-type invariants of graphs. Journal of Graph Theory, 17(3):393-407, 1993.
20. S. Kar and J.M.F. Moura. Topology for global average consensus. Fortieth Asilomar Conference on Signals, Systems, and Computers (to appear in proceedings), 2006.
21. W. Ren, R. W. Beard, and T. W. McLain. Coordination variables and consensus building in multiple vehicle systems. "Proc. of the Block Island Workshop on Cooperative Control, Lecture Notes in Control and Information Sciences series,Springer-Verlag", 309:171-188, 2004.
22. R. Olfati Saber. Ultrafast consensus in small-world networks. Proceedings of the American Control Conference, 4:2371-2378, 2005.
23. R. Olfati Saber and R.M Murray. Consensus problems in networks of agents with switcing topology and time-delays. IEEE Transactions on Automatic Control, 49(9):1520-1533, 2004.
24. R. Olfati Saber. Algebraic connectivity ratio of Ramanujan graphs Proceedings of the American Control Conference, 4619-4624, 2007.
25. S. Patterson, B. Bamieh, and A. El Ebadi distributed average consensus with stochastic communication failures Proceedings of 46th IEEE Conference on Decision and Control, 4251-4220, 2007.
26. E. Seneta. Nonnegative Matrices and Markov Chains. Springer, 1981.
27. A. Tahbaz-Salehi and A. Jadbabaie. Small world phenomenon, rapidly changing markov chains, and average consensus algorithm. Proceedings of 46th IEEE Conference on Decision and Control, 2007.
28. D.J. Watts and S.H. Strogatz. Collective dynamics of small-world networks. Nature, 393:440-442, 1998.
29. L. Xiao, S. Boyd, and S. Lall. A scheme for robust distributed sensor fusion based on average consensus. Proc. of International Conference on Information Processing in Sensor Networks, pages 63-70, 2005.