A decentralized algorithm for spectral analysis

Journal of Computer and System Sciences

Volumn 74, Issue 1, 2008, Pages 70-83

  Kempe, David ^a   McSherry, Frank ^b  

^a University of Southern California   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

Decentralized algorithm; Eigenvectors; Large networks; Markov Chain; Spectral analysis

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER NETWORKS; EIGENVALUES AND EIGENFUNCTIONS; GLOBAL OPTIMIZATION; MARKOV PROCESSES;

DECENTRALIZED ALGORITHMS; GLOBAL STATE; LARGE NETWORKS;

SPECTRUM ANALYSIS;

EID: 35448950468     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2007.04.014     Document Type: Article

References (27)

1. S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker, A scalable content-addressable network, in: Proc. ACM-SIGCOMM Conference, 2001, pp. 161-172
2. A. Rowstron, 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, 2001, pp. 329-350
3. I. Stoica, R. Morris, D. Karger, F. Kaashoek, H. Balakrishnan, Chord: A scalable peer-to-peer lookup service for Internet applications, in: Proc. ACM-SIGCOMM Conference, 2001, pp. 149-160
4. B. Zhao, J. Kubiatowicz, A. Joseph, Tapestry: An infrastructure for fault-tolerant wide-area location and routing, Tech. Rep. UCB/CSD-01-1141, UC Berkeley, 2001
5. Brin S., and Page L. The anatomy of a large-scale hypertextual web search engine. Comput. Netw. ISDN Systems 30 (1998) 107-117
6. Kleinberg J. Authoritative sources in a hyperlinked environment. J. ACM 46 (1999) 604-632
7. Fiedler M. A property of eigenvectors of nonnegative symmetric matrices and its applications to graph theory. Czechoslovak Math. J. 25 (1975) 619-633
8. R. Kannan, S. Vempala, A. Vetta, On clusterings: Good, bad and spectral, in: Proc. 41st IEEE Symp. on Foundations of Computer Science, 2000, pp. 367-377
9. A. Ng, M. Jordan, Y. Weiss, On spectral clustering: Analysis and an algorithm, in: Proc. 14th Advances in Neural Information Processing Systems, 2002, pp. 849-856
10. F. McSherry, Spectral partitioning of random graphs, in: Proc. 42nd IEEE Symp. on Foundations of Computer Science, 2001, pp. 529-537
11. Deerwester S., Dumais S., Landauer T., Furnas G., and Harshman R. Indexing by latent semantic analysis. J. Amer. Soc. Inform. Sci. 41 (1990) 391-407
12. D. Achlioptas, A. Fiat, A. Karlin, F. McSherry, Web search via hub synthesis, in: Proc. 42nd IEEE Symp. on Foundations of Computer Science, 2001, pp. 500-509
13. Y. Azar, A. Fiat, A. Karlin, F. McSherry, J. Saia, Spectral analysis of data, in: Proc. 33rd ACM Symp. on Theory of Computing, 2001, pp. 619-626
14. Leighton F., and Rao S. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM 46 (1999) 787-832
15. Granovetter M. The strength of weak ties. Amer. J. Sociol. 78 (1973) 1360-1380
16. Chung F. Spectral Graph Theory (1997), American Mathematical Society
17. Gallivan K., Heath M., Ng E., Peyton B., Plemmons R., Ortega J., Romine C., Sameh A., and Voigt R. Parallel Algorithms for Matrix Computations (1990), Society for Industrial and Applied Mathematics
18. I. Benjamini, L. Lovász, Global information from local observation, in: Proc. 43rd IEEE Symp. on Foundations of Computer Science, 2002, pp. 701-710
19. D. Kempe, A. Dobra, J. Gehrke, Computing aggregate information using gossip, in: Proc. 44th IEEE Symp. on Foundations of Computer Science, 2003, pp. 482-491
20. S. Boyd, A. Ghosh, B. Prabhakar, D. Shah, Analysis and optimization of randomized gossip algorithms, in: Proc. 43rd IEEE Conference on Decision and Control, 2004, pp. 5310-5315
21. S. Boyd, A. Ghosh, B. Prabhakar, D. Shah, Gossip algorithms: Design, analysis and applications, in: Proc. 24th IEEE INFOCOM Conference, 2005, pp. 1653-1664
22. Boyd S., Diaconis P., and Xiao L. Fastest mixing Markov Chain on a graph. SIAM Rev. 46 (2004) 667-689
23. S. Boyd, A. Ghosh, B. Prabhakar, D. Shah, Mixing times for random walks on geometric random graphs, in: Proc. 2nd SIAM Workshop on Analytic Algorithms and Combinatorics, 2005
24. Golub G., and van Loan C. Matrix Computations. third ed. (1996), Johns Hopkins University Press
25. Saloff-Coste L. Lectures on finite Markov Chains. Lecture Notes in Math. vol. 1665 (1997), Springer 301-408 École d'été de St. Flour 1996
26. Stewart G. On the perturbation of LU and Cholesky factors. IMA J. Numer. Anal. 17 (1997) 1-6
27. Wedin P. Perturbation theory for pseudo-inverses. BIT 13 (1973) 217-232