Finding planted partitions in random graphs with general degree distributions

SIAM Journal on Discrete Mathematics

Volumn 23, Issue 4, 2009, Pages 1682-1714

  Coja Oghlant, Amin ^a   Lanka, Andre ^b  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b CHEMNITZ UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Algorithms; Partitioning; Random graphs; Spectral methods

Indexed keywords

AVERAGE DEGREE; DEGREE DISTRIBUTIONS; DEGREE SEQUENCE; DIFFERENT DISTRIBUTIONS; LARGE NETWORKS; LARGE PARTS; PLANTED PARTITION; POLYNOMIAL-TIME ALGORITHMS; RANDOM GRAPH MODELS; RANDOM GRAPHS; REAL-WORLD NETWORKS; SPECTRAL METHODS;

AGRICULTURE; ALGORITHMS; GRAPHIC METHODS; POLYNOMIAL APPROXIMATION; SPECTROSCOPY;

GRAPH THEORY;

EID: 77950802458     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/070699354     Document Type: Article

References (28)

1. W. Aiello, F. Chung, and L. Lu, A random graph model for massive graphs, in Proceedings of the 33rd ACM STOC, 2001, pp. 171-180.
2. N. Alon, Spectral Techniques in Graph Algorithms, Lecture Notes in Comput. Sci. 1380, Springer, New York, 1998, pp. 206-215. (Pubitemid 128056278)
3. N. Alon and N. Kahale, A spectral technique for coloring random 3-colorable graphs, SIAM J. Comput., 26 (1997), pp. 1733-1748. (Pubitemid 127582005)
4. N. Alon, M. Krivelevich, and V. Vu, On the concentration of the eigenvalues of random symmetric matrices, Israel J. Math., 131 (2002), pp. 259-267.
5. Y. Azar, A. Fiat, A. Karlin, F. McSherry, and J. Saia, Spectral analysis of data, in Proceedings of the 33rd ACM STOC, 2001, pp. 619-626. (Pubitemid 32865779)
6. R. Boppana, Eigenvalues and graph bisection: An average case analysis, in Proceedings of the 28th IEEE FOCS, 1987, pp. 280-285. (Pubitemid 18538606)
7. F. Chung, Spectral Graph Theory, American Mathematical Society, Providence, RI, 1997.
8. F. Chung and L. Lu, Connected components in random graphs with given expected degree sequences, Ann. Comb., 6 (2002), pp. 125-145. (Pubitemid 36048698)
9. F. Chung, L. Lu, and V. Vu, The spectra of random graphs with given expected degrees, Internet Math., 1 (2003), pp. 257-275. (Pubitemid 36666578)
10. A. Coja-Oghlan, On the Laplacian eigenvalues of Gn,p, Combin. Probab. Comput., 16 (2007), pp. 923-946.
11. A. Coja-Oghlan and A. Lanka, The Spectral Gap of Random Graphs with Given Expected Degrees, Lecture Notes in Comput. Sci. 4051, Springer, New York, 2006, pp. 15-26. (Pubitemid 44113285)
12. A. Coja-Oghlan, A. Goerdt, and A. Lanka, Spectral Partitioning of Random Graphs with Given Expected Degrees-Detailed Version, Technical report CSR-09-101, Chemnitz Informatics Reports, Technical University Chemnitz, Chemnitz, Germany.
13. A. Dasgupta, J. Hopcroft, R. Kannan, and P. Mitra, Spectral clustering by recursive partitioning, in Proceedings of the 14th ESA, 2006, pp. 256-267. (Pubitemid 44699656)
14. A. Dasgupta, J. Hopcroft, and F. McSherry, Spectral analysis of random graphs with skewed degree distributions, in Proceedings of the 45th IEEE FOCS, 2004, pp. 602-610. (Pubitemid 40575321)
15. C. Ding, Analysis of gene expression profiles: Class discovery and leaf ordering, in Proceedings of the 6th International Conference on Computational Biology, 2002, pp. 127-136.
16. U. Feige and E. Ofek, Spectral techniques applied to sparse random graphs, Random Structures Algorithms, 27 (2005), pp. 251-275. (Pubitemid 41482549)
17. A. Flaxman, A spectral technique for random satisfiable 3CNF formulas, Random Struct. Algorithms, 32 (2008), pp. 519-534.
18. J. Friedman, J. Kahn, and E. Szemeŕedi, On the second eigenvalue in random regular graphs, in Proceedings of the 21st ACM STOC, 1989, pp. 587-598.
19. Z. Füredi and J. Komlós, The eigenvalues of random symmetric matrices, Combinatorica, 1 (1981), pp. 233-241.
20. J. Giesen and D. Mitsche, Reconstructing many partitions using spectral techniques, in Proceedings of the 15th FCT, 2005, pp. 433-444. (Pubitemid 41449470)
21. S. Janson, T.Łuczak, and A. Rucínski, Random Graphs, John Wiley and Sons, New York, 2000.
22. J. Jensen, Sur les fonctions convexes et les inegalites entre les valeurs moyennes, ActaMath., 30 (1906), pp. 175-193.
23. M. Krivelevich and B. Sudakov, The largest eigenvalue of sparse random graphs, Combin. Probab. Comput., 12 (2003), pp. 61-72. (Pubitemid 36165616)
24. F. McSherry, Spectral partitioning of random graphs, in Proceedings of the 42nd IEEE FOCS, 2001, pp. 529-537. (Pubitemid 33068414)
25. M. Mihail and C. Papadimitriou, On the eigenvalue power law, in Proceedings of the 6th RANDOM, 2002, pp. 254-262.
26. A. Pothen, H. Simon, and K. Liou, Partitioning sparse matrices with eigenvectors of graphs, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 430-452.
27. K. Schloegel, G. Karypis, and V. Kumar, Graph partitioning for high performance scientific simulations, in CRPC Parallel Computation Handbook, J. Dongarra, I. Foster, G. Fox, K. Kennedy, and W. White, eds., Morgan Kaufmann, San Mateo, CA, 2000.
28. D. Spielman and S. Teng, Spectral partitioning works: Planar graphs and finite element meshes, in Proceedings of the 36th IEEE FOCS, 1996, pp. 96-105.