The spectral gap of random graphs with given expected degrees

Electronic Journal of Combinatorics

Volumn 16, Issue 1 R, 2009, Pages

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

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b CHEMNITZ UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 72449169704     PISSN: None     EISSN: 10778926     Source Type: Journal    
DOI: 10.37236/227     Document Type: Article

References (24)

1. Albert, R., Barabási, A.L.: Statistical mechanics of complex networks. Reviews of modern physics 74 (2002) 47-97
2. Alon, N., Kahale, N.: A spectral technique for coloring random 3-colorable graphs. SIAM J. Comput. 26 (1997) 1733-1748
3. Alon, N., Krivelevich, M., Sudakov, B.: Finding a large hidden clique in a random graph. Random Structures and Algorithms 13 (1998) 457-466
4. Bollobás, B., Riordan, O.: Mathematical results on scale-free random graphs. In Bornholdt, S., Schuster, H.G. (eds.): Handbook of graphs and networks: from the genome to the Internet, Wiley 2003, 1-34
5. Chung, F.: Spectral Graph Theory. American Mathematical Society 1997
6. Chung, F., Graham, R.L.: Quasi-random graphs with with given degree sequences. Random Structures and Algorithms 32 (2008) 1-19
7. Chung, F., Lu, L.: Connected components in random graphs with given expected degree sequences. Annals of Combinatorics 6 (2002) 125-145
8. Chung, F., Lu, L., Vu, V.: The spectra of random graphs with given expected degrees. Internet Mathematics 1 (2003) 257-275
9. Coja-Oghlan, A., Lanka, A.: Finding planted partitions in random graphs with general degree distributions. SIAM Journal on Discrete Mathematics, to appear.
10. Coja-Oghlan, A.: On the Laplacian eigenvalues of Gn,p. Combinatorics, Probability and Computing 16 (2007) 923-946
11. Dasgupta, A., Hopcroft, J.E., McSherry, F.: Spectral Partitioning of Random Graphs. Proc. 45th FOCS (2004) 529-537
12. Faloutsos, M., Faloutsos, P., Faloutsos, C.: On powerlaw relationships of the internet topology. Proc. of ACM-SIGCOMM (1999) 251-262
13. Feige, U., Ofek, E.: Spectral techniques applied to sparse random graphs. Random Structures and Algorithms 27 (2005) 251-275
14. Friedman, J., Kahn, J., Szemeredi, E.: On the second eigenvalue in random regular graphs. Proc. 21st STOC (1989) 587-598
15. Füredi, Z., Komloś, J.: The eigenvalues of random symmetric matrices. Combinatorica 1 (1981) 233-241
16. Guattery, S., Miller, G.L.: On the quality of spectral separators. SIAM J. Matrix Anal. Appl. 19 (1998) 701-719
17. Janson, S., Luczak, T., Ruciński, A.: Random Graphs. Wiley (2000)
18. Krivelevich, M., Vu, V.H.: Approximating the independence number and the chromatic number in expected polynomial time. J. of Combinatorial Optimization 6 (2002) 143-155
19. Krivelevich, M., Sudakov, B.: The largest eigenvalue of sparse random graphs. Combinatorics, Probability and Computing 12 (2003) 61-72
20. McSherry, F.: Spectral partitioning of random graphs. Proc. 42nd FOCS (2001) 529-537
21. Mihail, M., Papadimitriou, C.H.: On the eigenvalue power law. Proc. 6th RANDOM (2002) 254-262
22. Pothen, A., Simon, H.D., Liou, K.-P.: Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl. 11 (1990) 430-452
23. 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)
24. Wigner, E.P.: On the distribution of the roots of certain symmetric matrices. Annals of Mathematics 67 (1958) 325-327