Partitioning random graphs with general degree distributions

IFIP International Federation for Information Processing

Volumn 273, Issue , 2008, Pages 127-141

  Coja Oghlan, Amin ^a   Lanka, André ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b CHEMNITZ UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; POLYNOMIAL APPROXIMATION;

DEGREE DISTRIBUTIONS; DEGREE SEQUENCE; LARGE NETWORKS; PLANTED PARTITION; POLYNOMIAL-TIME ALGORITHMS; RANDOM GRAPH MODELS; RANDOM GRAPHS; REAL-WORLD NETWORKS;

GRAPH THEORY;

EID: 48249136133     PISSN: 15715736     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-09680-3_9     Document Type: Conference Paper

References (18)

1. Aiello, W., Chung, F., Lu, L.: A random graph model for massive graphs. Proc. 33rd. SToC (2001), 171-180.
2. Alon, N. Spectral techniques in graph algorithms. Proc. LATIN (1998), LNCS 1380, Springer, 206-215.
3. Alon, N., Kahale, N.: A spectral technique for coloring random 3-colorable graphs. SIAM J. Comput. 26 (1997) 1733-1748.
4. Azar, Y., Fiat, A., Karlin, A.R., McSherry, F., Saia, J.: Spectral analysis of data. Proc. 33rd STOC (2001) 619-626
5. Boppana, R.B.: Eigenvalues and graph bisection: An average case analysis. Proc. 28th FoCS (1987), 280-285.
6. Chung, F.K.R.: Spectral Graph Theory. American Mathematical Society (1997).
7. Chung, F.K.R., Lu, L.: Connected components in random graphs with given expected degree sequences. Annals of Combinatorics 6 (2002) 125-145.
8. Coja-Oghlan, A., Lanka, A.: The Spectral Gap of Random Graphs with Given Expected Degrees. Proc. ICALP (2006), LNCS 4051, Springer, 15-26.
9. Coja-Oghlan, A., Goerdt, A., Lanka, A.: Spectral Partitioning of Random Graphs with Given Expected Degrees. Preprint, submitted for publication. Available at http://www.tu-chemnitz.de/informatik/TI/publications/ spj10.pdf
10. Ding. C.H.Q.: Analysis of gene eCpression profiles: class discovery and leaf ordering. Proc. 6th International Conference on Computational biology (2002) 127-136
11. Dasgupta, A., Hopcroft, J.E., McSherry, F.: Spectral Analysis of Random Graphs with Skewed Degree Distributions. Proc. 45th FOCS (2004) 602-610.
12. Flaxman, A.: A spectral technique for random satisfiable 3CNF formulas. Proc. 14th SODA (2003) 357-363.
13. Füredi, Z., Komloś, J.: The eigenvalues of random symmetric matrices. Combinatorica 1 (1981) 233-241.
14. Janson, S., Łuczak, T., Ruciński, A.: Random graphs. John Wiley and Sons 2000.
15. McSherry, F.: Spectral Partitioning of Random Graphs. Proc. 42nd FoCS (2001) 529-537.
16. Mihail, M., Papadimitriou, C.H.: On the Eigenvalue Power Law. Proc. 6th RANDOM (2002) 254-262.
17. Pothen, A., Simon, H.D., Liou, K.-P.: Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl. 11(1990) 430-452
18. Schloegel, K., Karypis, G., Kumar, V.: Graph partitioning for high performance scientific simulations. in: Dongarra, J., Foster, I., Fox, G., Kennedy, K., White, A. (eds.): CRPC parallel computation handbook. Morgan Kaufmann (2000)