Analysis and optimization of randomized gossip algorithms

Proceedings of the IEEE Conference on Decision and Control

Volumn 5, Issue , 2004, Pages 5310-5315

  Boyd, Stephen ^a   Ghosh, Arpita ^a   Prabhakar, Balaji ^a   Shah, Devavrat ^a  

^a Stanford University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; ITERATIVE METHODS; MARKOV PROCESSES; MATRIX ALGEBRA; OPTIMIZATION; SET THEORY;

GOSSIP CONSTRAINTS; MIXING TIME; RANDOMIZED GOSSIP ALGORITHMS;

ALGORITHMS;

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

References (13)

1. [BDX04] S. Boyd, P. Diaconis, and L. Xiao. Fastest mixing Markov chain on a graph. To appear in SIAM Review, problems and techniques section, 2004. Available at www.stanford.edu/~boyd/frame.html.
2. [BGPS04a] S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. Gossip algorithms: Design, analysis, and applications. Submitted, 2004. Available at www.stanford.edu/~arpitag/papers/gossip.ps.
3. [BGPS04b] S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. Mixing times for random walks on random graphs. Submitted, 2004. Available at www.stanford.edu/~arpitag/papers/mixgnr.ps.
4. [BV03] S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2003. Available at http://www.stanford.edu/~boyd/cvxbook.html.
5. [EKN90] L. Eisner, I. Koltracht, and M. Neumann. On the convergence of asynchronous paracontractions with applications to tomographic reconstruction from incomplete data. Linear Algebra Appl., (130):65-82, 1990.
6. [Gur00] V. Guruswami. Rapidly mixing markov chains: A comparison of techniques. May 2000. Available at cs.washington.edu/homes/venkat/ pubs/papers.html.
7. [KDG03] D. Kempe, A. Dobra, and J. Gehrke. Gossip-based computation of aggregate information. In Proc. Conference on Foundations of Computer Science. IEEE, 2003.
8. [KSSV00] R. Karp, C. Schindelhauer, S. Shenker, and B. Vcking. Randomized rumor spreading. In Proc. Symposium on Foundations of Computer Science. IEEE, 2000.
9. [LO96] A. S. Lewis and M. L. Overton. Eigenvalue optimization. Acta Numerica, 5:149-190, 1996.
10. [Ove92] M. L. Overton. Large-scale optimization of eigenvalues. SIAM Journal on Optimization, 2:88-120, 1992.
11. [RSW98] Y. Rabani, A. Sinclair, and R. Wanka. Local divergence of Markov chains and the analysis of iterative load-balancing schemes. In Proc. Conference on Foundations of Computer Science. IEEE, 1998.
12. [WSV00] H. Wolkowicz, R. Saigal, and L. Vandengerghe, editors. Handbook of Semidefinite Programming, Theory. Algorithms, and Applications. Kluwer Academic Publishers, 2000.
13. [XB03] L. Xiao and S. Boyd. Fast linear iterations for distributed averaging. In Proc. 2003 Conference on Decision and Control, December 2003.