Fast gossip via non-reversible random walk

2006 IEEE Information Theory Workshop, ITW 2006

Volumn , Issue , 2006, Pages 67-71

  Jung, Kyomin ^a   Shah, Devavrat ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MAXIMAL MATCHING ALGORITHM; NETWORK GRAPH; RANDOM WALK;

ALGORITHMS; EIGENVALUES AND EIGENFUNCTIONS; GRAPH THEORY; ITERATIVE METHODS; SCHEDULING; SENSORS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 33751032402     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. D. Bertsekas. The auction algorithm: A distributed relaxation method for the assignment problem. Annals of operations research, 1988.
2. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. Gossip algorithms: Design, analysis and applications. In Proceedings of IEEE INFOCOM 2005, 2005.
3. F. Chen, L. Lovasz, and I. Pak. Lifting markov chains to speed up mixing. In Proceedings of the seventeenth annual ACM symposium on Theory of computing, pages 275-281, 1999.
4. P. Diaconis, S. Holmes, and R. Neal. Analysis of a nonreversible markov chain sampler. The Annals of Applied Probability, 10(3):726-752, 2000.
5. A. Israeli and A. Itai. A fast randomized parallel algorithm for maximal matching. Inform. Process. Lett., 22(2):77-80, 1986.
6. R. Karp, C. Schindelhauer, S. Shenker, and B. Vcking. Randomized rumor spreading. In Proc. Symposium on Foundations of Computer Science. IEEE, 2000.
7. R. M. Karp, E. Upfal, and A. Wigderson. Constructing a perfect matching is in random NC. In In Proceedings of the seventeenth annual ACM symposium on Theory of computing, 1985.
8. D. Kempe, A. Dobra, and J. Gehrke. Gossip-based computation of aggregate information. In Proc. Conference on Foundations of Computer Science. IEEE, 2003.
9. D. Kempe and F. McSherry. A decentralized algorithm for spectral analaysis. In Symposium on Theory of Computing. ACM, 2004.
10. E. Modiano, D. Shah, and G. Zussman. Maximizing throughput in wireless networks via gossip. Submitted, 2005.
11. D. Mosk-Aoyama and D. Shah. Distributed computation of separable function. Submitted, 2006.
12. K. Mulmuley, U. Vazirani, and V. Vazirani. Matching is as easy as matrix inversion. In Proceedings of the nineteenth annual ACM conference on Theory of computing, 1987.
13. J. N. Tsitsiklis. Problems in Decentralized Decision Making and Computation. PhD thesis, MIT, 1984.