Spectral analysis of random graphs with skewed degree distributions

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2004, Pages 602-610

  Dasgupta, Anirban ^a   Hopcroft, John E ^a   McSherry, Frank ^b  

^a Dept of Computer Science ^*  (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POWER LAW GRAPHS; RANDOM ADJACENCY; RANDOM GRAPHS; SKEWED DEGREE DISTRIBUTION;

EMBEDDED SYSTEMS; LAPLACE TRANSFORMS; MATHEMATICAL MODELS; PERTURBATION TECHNIQUES; PROBABILITY; RANDOM PROCESSES; SPECTRUM ANALYSIS;

GRAPH THEORY;

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

References (33)

1. D. Achlioptas, A. Fiat, A. Karlin, F. McSherry. Web search via hub synthesis. FOCS 2001.
2. D. Achlioptas and F. McSherry, Fast Computation of Low Rank Matrix Approximations, STOC, 2001.
3. N. Alon, M. Krivelevich, B. Sudakov, Finding a large hidden clique in a random graph, SODA 1998.
4. N. Alon, M. Krivelevich, V. Vu, On the concentration of eigenvalues of random symmetric matrices, Tech. Report 60, Microsoft Research, 2000.
5. C. J. Alpert and S. Z. Yao, Spectral Partitioning: The More Eigenvectors, the Better, UCLA CS Dept. Technical Report, #940036, October 1994.
6. Y. Azar, A. Fiat, A. Karlin, F. McSherry, J. Saia Spectral Analysis of Data STOC, 2001.
7. R. B. Boppana. Eigenvalues and graph bisection: an average-case analysis. FOCS, 1987.
8. F. R. K. Chung, L. Lu, V. Vu. The spectra of random graphs with given expected degrees PNAS 100, no. 11, (2003), 6313-6318.
9. A. Condon and R. M. Karp. Algorithms for graph partitioning on the planted partition model. Random Structures and Algorithms, 18:2, 116-140, 2001.
10. C. Davis and W. Kahan, The Rotation of Eigenvectors by a Perturbation 3. SIAM Journal on Numerical Analysis, Vol 7, 1970, 1-46.
11. P. Husbands, H. Simon, and C. Ding, On the Use of the Singular Value Decomposition for Text Retrieval. Proc. of SIAM Comp. Info. Retrieval Workshop.
12. I. Dhillon, Co-Clustering Documents and Words Using Bipartite Spectral Graph Partitioning. SIGKDD, 2001.
13. H. Zha, X. He, C. Ding, M. Gu and H. Simon, Bipartite Graph Partitioning and Data Clustering. CIKM, 2001.
14. P. Drineas, R. Kannan, A. Frieze, S. Vempala, and V. Vinay, Clustering in large graphs and matrices. SODA, 1999.
15. S. Deerwester, S. T. Dumais, T. K. Landauer, G. W. Furnas, and R. A. Harshman, Indexing by latent semantic analysis. Journal of the Society for Information Science, Vol 41, 1990, 391-407.
16. Z. Furedi and J. Komlos, The eigenvalues of random symmetric matrices, Combinatorica 1(3), 233-241 (1981).
17. G. Golub, C. Van Loan (1996), Matrix computations, third edition, The Johns Hopkins University Press Ltd., London
18. K. S. Jones, S. Walker, S. E. Robertson Probabilistic Model of Information Retrieval: Development and Status, Information Processing and Management, 1998.
19. R. Kannan, S. Vempala, A. Vetta On clusterings-good, bad and spectral. FOCS, 2000.
20. J. Kleinberg, Authoritative sources in a hyperlinked environment, Journal of the ACM, Vol 46,1999, 604-632.
21. F. McSherry. Spectral Partitioning of Random Graphs. FOCS, 2001.
22. M. Mihail, C.Papadimitriou. On the Eigenvalue Power Law. RANDOM 2002.
23. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
24. A. Ng and M. Jordan and Y. Weiss. On spectral clustering: Analysis and an algorithm, NIPS 2001.
25. L. Page and S. Brin, PageRank, an Eigenvector based Ranking Approach for Hypertext. SIGIR, 1998
26. C. H. Papadimitriou, H. Tamaki, P. Raghavan and S. Vempala, Latent Semantic Indexing: A Probabilistic Analysis. PODS, 1998.
27. R. Lempel, S. Moran. SALSA: the stochastic approach for link-structure analysis. TOIS 19(2): 131-160 (2001)
28. R. Lempel, S. Moran. Rank Stability and Rank Similarity of Link-Based Web Ranking Algorithms in Authority Connected Graphs. Information Retrieval, special issue on Advances in Mathematics/Formal Methods in Information Retrieval.
29. M. E. J. Newman, S. H. Strogatz, and D. J. Watts., Random graphs with arbitrary degree distribution and their application. Physical Review E 64, 026118 (2001).
30. D. A. Spielman, S. H. Teng, Spectral Partitioning Works: Planar graphs and finite element meshes. FOCS, 1996.
31. G. W. Stewart, J. G. Sun, Matrix perturbation theory. Academic Press Inc., Boston MA, 1990
32. E. Wigner, On the distribution of the roots of certain symmetric matrices, Annales of Math. Vol. 67, 325-327, 1958.
33. J. Zobel, A. Moffat. Exploring the Similarity Space, SIGIR. 32(1), 18-34, 1998.