Small world phenomenon, rapidly mixing Markov chains, and average consensus algorithms

Proceedings of the IEEE Conference on Decision and Control

Volumn , Issue , 2007, Pages 276-281

  Tahbaz Salehi, Alireza ^a   Jadbabaie, Ali ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; GRAPH THEORY; MARKOV PROCESSES; PROBABILITY;

CONSENSUS ALGORITHMS; CONVERGENCE SPEED;

ALGORITHMS;

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

References (26)

1. D. J. Watts and S. H. Strogatz, "Collective dynamics of 'small world' networks," Nature, vol. 393, pp. 440-442, 1998.
2. M. E. J. Newman, "Scientific collaboration networks: I. Network construction and fundamental results," Physical Review E, vol. 64, no. 1, p. 016131, 2001.
3. A. Barabási, R. Albert, and H. Jeong, "Scale-free characteristics of random networks: the topology of the world-wide web," Physica A: Statistical Mechanics and its Applications, vol. 281, pp. 69-77, 2000.
4. A. N. Amaral, A. Scala, M. Barthélémy, and H. E. Stanley, "Classes of small world networks," Proceedings of National Academy of Science, vol. 97, pp. 11 149-11 152, 2000.
5. S. H. Strogatz, "Exploring complex networks," Nature, vol. 410, pp. 268-276, 2001.
6. J. G. White, E. Southgate, J. N. Thomson, and S. Brenner, "The structure of the nervous system of the nematode Caenorhabditis elegans," Philosophical Transactions of the Royal Society of London, vol. 314, no. 1165, pp. 1-340, 1986.
7. M. E. J. Newman, "The structure and function of complex networks," SIAM Review, vol. 45, p. 167, 2003.
8. M. E. J. Newman, C. Moore, and D. J. Watts, "Mean-field solution of the small-world network model," Physical Review Letters, vol. 84, no. 14, pp. 3201-3204, Apr 2000.
9. J. Kleinberg, "The small world phenomenon: An algorithmic approach," in Proceedings of 32nd annual ACM Symposium on Theory of Computing. New York, NY: ACM Press, 2000, pp. 163-170.
10. _, "Small world phenomena and dynamics of information," in Advances in Neural Information Processing Systems (NIPS) 14, 2001.
11. R. Olfati-Saber, "Ultrafast consensus in small world networks," in Proceedings of the 2005 American Control Conference, june 2005, pp. 2371-2378.
12. P. Hovareshti and J. S. Baras, "Consensus problems on small world graphs: A structural study," Institute for Systems Research, College Park, MD, Tech. Rep., 2006.
13. B. Bollabás and F. R. K. Chung, "The diameter of a cycle plus a random matching," SIAM Journal of Discrete Mathematics, vol. 1, no. 3, pp. 328-333, 1988.
14. R. Durrett, Random Graph Dynamics. Cambridge University Press, 2007.
15. A. Berman and R. J. Plemmons, Nonnegative Matrices in the Mathematical Sciences. New York: Academic Press, 1979.
16. A. J. Sinclair, "Improved bounds for mixing rates of Markov chains and multicommodity flow," Combinatorics, Probability and Computing, vol. 1, pp. 351-370, 1992.
17. V. D. Blondel, J. M. Hendrickx, A. Olshevsky, and J. N. Tsitsklis, "Convergence in multiagent coordination, consensus, and flocking," in Proceedings of the Joint 44th IEEE Conference on Decision and Control and European Control Conference, Seville, Spain, Dec. 2005, pp. 2996-3000.
18. L. Moreau, "Stability of multiagent systems with time-dependent communication links," IEEE Transactions on Automatic Control, vol. 50, no. 2, pp. 169-182, 2005.
19. F. Chung and L. Lu, "The average distance in a random graph with given expected degrees," Proceedings of the National Academy of Sciences, vol. 99, no. 25, pp. 15 879-15 882, 2002.
20. R. Olfati-Saber, J. A. Fax, and R. M. Murray, "Consensus and cooperation in networked multi-agent systems," Proceedings of the IEEE, vol. 95, no. 1, 2007.
21. A. D. Flaxman and A. M. Frieze, "The diameter of randomly perturbed digraphs and some applications," Random Structures & Algorithms, vol. 30, no. 4, pp. 484-504, 2007.
22. S. Boyd, P. Diaconis, and L. Xiao, "Fastest mixing Markov chain on a graph," SIAM Review, problems and techniques section, vol. 46, no. 4, pp. 667-689, Dec 2004.
23. B. Mohar, "Eigenvalues, diameter and mean distance in graphs," Graph and Combinatorics, vol. 7, no. 1, pp. 53-64, 1991.
24. _, "The Laplacian spectrum of graphs," Graph Theory, Combinatorics, and Applications, vol. 2, pp. 871-898, 1991.
25. R. Olfati-Saber and R. M. Murray, "Consensus problems in networks of agents with switching topology and time delays," IEEE Transactions on Automatic Control, vol. 49, no. 9, pp. 1520-1533, 2004.
26. J. Sun, S. Boyd, L. Xiao, and P. Diaconis, "The fastest mixing Markov process on a graph and a connection to a maximum variance unfolding problem," SIAM Review, vol. 48, no. 4, pp. 681-699, 2006.