A decentralized algorithm for spectral analysis

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2004, Pages 561-568

  Kempe, David ^a   McSherry, Frank ^b  

^a UNIVERSITY OF WASHINGTON   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

Decentralized Algorithm; Eigenvectors; Large Networks; Markov Chain; Spectral Analysis

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; EIGENVALUES AND EIGENFUNCTIONS; MARKOV PROCESSES; PROBLEM SOLVING; THEOREM PROVING;

COMPUTATIONAL POWER; DECENTRALIZED ALGORITHMS; LARGE NETWORKS;

INTERNET;

EID: 4544320214     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007352.1007438     Document Type: Conference Paper

References (25)

1. D. Achlioptas, A. Fiat, A. Karlin, and F. McSherry. Web search via hub synthesis. In Proc. 42nd IEEE Symp. on Foundations of Computer Science, 2001.
2. Y. Azar, A. Fiat, A. Karlin, F. McSherry, and J. Saia. Spectral analysis of data. In Proc. 33rd ACM Symp. on Theory of Computing, 2001.
3. I. Benjamini and L. Lovász. Global information from local observation. In Proc. 43rd IEEE Symp. on Foundations of Computer Science, 2002.
4. S. Boyd, P. Diaconis, and L. Xiao. Fastest mixing markov chain on a graph. Submitted to SIAM Review.
5. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. Gossip and mixing times of random walks on random graphs. Submitted.
6. S. Brin and L. Page. The anatomy of a large-scale hypertextual web search engine. Computer Networks and ISDN Systems, 30:107-17, 1998.
7. F. Chung. Spectral Graph Theory. American Mathematical Society, 1997.
8. S. Deerwester, S. Dumais, T. Landauer, G. Furnas, and R. Harshman. Indexing by latent semantic analysis. J. of the American Society for Information Sciences, 41:391-407, 1990.
9. M. Fiedler. A property of eigenvectors of nonnegative symmetric matrices and its applications to graph theory. Czechoslovak Mathematical Journal, 25:619-633, 1975.
10. K. Gallivan, M. Heath, E. Ng, B. Peyton, R. Plemmons, J. Ortega, C. Romine, A. Sameh, and R. Voigt. Parallel Algorithms for Matrix Computations. Society for Industrial and Applied Mathematics, 1990.
11. G. Golub and C. V. Loan. Matrix Compulations, Johns Hopkins University Press, third edition, 1996.
12. M. Granovetter. The strength of weak ties. American Journal of Sociology, 78:1360-1380, 1973.
13. R. Kannan, S. Vempala, and A. Vetta. On clusterings: Good, bad and spectral. In Proc. 41st IEEE Symp. on Foundations of Computer Science, 2000.
14. D. Kempe, A. Dobra, and J. Gehrke. Computing aggregate information using gossip. In Proc. 44th IEEE Symp. on Foundations of Computer Science, 2003.
15. J. Kleinberg. Authoritative sources in a hyperlinked environment. J. of the ACM, 46:604-632, 1999.
16. F. Leighton and S. Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. of the ACM, 46, 1999.
17. F. McSherry. Spectral partitioning of random graphs. In Proc. 42nd IEEE Symp. on Foundations of Computer Science, pages 529-537, 2001.
18. A. Ng, M. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. In Proc. 14th Advances in Neural Information Processing Systems, 2002.
19. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In Proc. ACM SIGCOMM Conference, pages 161-172, 2001.
20. A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proc. 18th IFIP/ACM Intl. Conf. on Distributed Systems Platforms (Middleware 2001), pages 329-350, 2001.
21. L. Saloff-Coste. Lectures on finite markov chains. In Lecture Notes in Mathematics 1665, pages 301-408. Springer, 1997. École d'été de St. Flour 1996.
22. G. Stewart. On the perturbation of LU and cholesky factors. IMA Journal of Numerical Analysis, 1997.
23. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proc. ACM SIGCOMM Conference, pages 149-160, 2001.
24. P. Wedin. Perturbation theory for pseudo-inverses. BIT, 13:217-232, 1973.
25. B. Y. Zhao, J. Kubiatowicz, and A. Joseph. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, UC Berkeley, 2001.