Analysis of accelerated gossip algorithms

Proceedings of the IEEE Conference on Decision and Control

Volumn , Issue , 2009, Pages 871-876

  Liu, J ^a   Anderson, B D O ^b   Cao, M ^c   Morse, A S ^a  

^a YALE UNIVERSITY   (United States)

^b AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^c UNIVERSITY OF GRONINGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CONTROL ENGINEERING;

ANALYTICAL RESULTS; DISTRIBUTED COMPUTATIONS; EMPIRICAL DATA; GOSSIP ALGORITHMS; MATRIX ANALYSIS; RATE OF CONVERGENCE; REGULAR GRAPHS; SECOND MOMENTS;

TOPOLOGY;

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

References (14)

1. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. Gossip algorithms: design, analysis and applications. In Proc. of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), pages 1653-1664, 2005.
2. M. Cao, A. S. Morse, and B. D. O. Anderson. Reaching a consensus in a dynamically changing environment - a graphical approach. SIAM Journal on Control and Optimization, 47(2):575-600, 2008.
3. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. Randomized gossip algorithms. IEEE Transactions on Information Theory, 52(6):2508-2530, 2006.
4. L. Xiao and S. Boyd. Fast linear iterations for distributed averaging. Systems and Control Letters, 53(1):65-78, 2004.
5. M. Cao, D. A. Spielman, and A. S. Morse. A lower bound on convergence of a distributed network consensus algorithm. In Proc. of the 44th IEEE CDC, pages 2356-2361, 2005.
6. C. C. Moallemi and B. V. Roy. Consensus propagation. IEEE Transactions on Information Theory, 52(11):4753-4766, 2006.
7. A. Olshevsky and J. Tsitsiklis. Convergence rates in distributed consensus and averaging. In Proc. of the 45th IEEE CDC, pages 3387-3392, 2006.
8. D. Mosk-Aoyama and D. Shah. Computing separable function via gossip. In Proc. of the 25th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 113-122, 2005.
9. A. G. Dimakis, A. D. Sarwate, and M. J. Wainwright. Geographic gossip: efficient aggregatiton for sensor networks. In Proc. of the 5th International Conference on Information Processing in Sensor Networks (IPSN), pages 69-76, 2006.
10. M. Cao, D. A. Spielman, and E. M. Yeh. Accelerated gossip algorithms for distributed computation. In Proc. of the 44th Annual Allerton Conference on Communication, Control, and Computation, pages 952-959, 2006.
11. B. Johansson and M. Johansson. Faster linear iterations for distributed averaging. In Proc. of the 17th International Federation of Automatic Control World Congress (IFAC), pages 2861-2866, 2008.
12. D. M. Cvetkovic, M. Doob, and H. Sachs. Spectra of Graphs: Theory and Application, page 72. Academic Press, New York, 1979.
13. N. Alon. Eigenvalues and expanders. Combinatorica, 6(2):83-96, 1986.
14. J. Friedman. A proof of Alon's second eigenvalue conjecture. In Proc. of the 35th Annual ACM Symposium on Theory of Computing (STOC), pages 720-724, 2003.