{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:48:16Z","timestamp":1725475696465},"publisher-location":"Boston, MA","reference-count":23,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387346335"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-0-387-34735-6_22","type":"book-chapter","created":{"date-parts":[[2006,12,14]],"date-time":"2006-12-14T18:32:32Z","timestamp":1166121152000},"page":"271-282","source":"Crossref","is-referenced-by-count":2,"title":["Spectral Partitioning of Random Graphs with Given Expected Degrees"],"prefix":"10.1007","author":[{"given":"Amin","family":"Coja-Oghlan","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Goerdt","sequence":"additional","affiliation":[]},{"given":"Andr\u00e9","family":"Lanka","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Aiello, W, Chung, F., Lu, L.: A random graph model for massive graphs. Proc. 33rd. SToC (2001), 171\u2013180.","DOI":"10.1145\/335305.335326"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N. Spectral techniques in graph algorithms. Proc. LATIN (1998), LNCS 1380, Springer, 206\u2013215.","DOI":"10.1007\/BFb0054322"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"1733","DOI":"10.1137\/S0097539794270248","volume":"26","author":"N. Alon","year":"1997","unstructured":"Alon, N., Kahale, N.: A spectral technique for coloring random 3-colorable graphs. SIAM J. Comput. 26 (1997) 1733\u20131748.","journal-title":"SIAM J. Comput"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Boppana, R.B.: Eigenvalues and graph bisection: An average case analysis. Proc. 28th FoCS (1987), 280\u2013285.","DOI":"10.1109\/SFCS.1987.22"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Chung, F.K.R.: Spectral Graph Theory. American Mathematical Society (1997).","DOI":"10.1090\/cbms\/092"},{"key":"22_CR6","unstructured":"Coja-Oghlan, A.: On the Laplacian eigenvalues of G n,p . Preprint (2005) http:\/\/www.informatik.hu-berlin.de\/~coja\/de\/publikation.php."},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Coja-Oghlan, A., Lanka, A.: The Spectral Gap of Random Graphs with Given Expected Degrees. Preprint (2006).","DOI":"10.1007\/11786986_3"},{"key":"22_CR8","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1080\/15427951.2004.10129089","volume":"1","author":"F.K.R. Chung","year":"2003","unstructured":"Chung, F.K.R., Lu, L., Vu, V.: The Spectra of Random Graphs with Given Expected Degrees. Internet Mathematics 1 (2003) 257\u2013275.","journal-title":"Internet Mathematics"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Dasgupta, A., Hopcroft, J.E., McSherry, F.: Spectral Analysis of Random Graphs with Skewed Degree Distributions. Proc. 45th FOCS (2004) 602\u2013610.","DOI":"10.1109\/FOCS.2004.61"},{"issue":"2","key":"22_CR10","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1002\/rsa.20089","volume":"27","author":"U. Feige","year":"2005","unstructured":"Feige, U., Ofek, E.: Spectral Techniques Applied to Sparse Random Graphs. Random Structures and Algorithms, 27(2) (2005), 251\u2013275.","journal-title":"Random Structures and Algorithms"},{"key":"22_CR11","unstructured":"Flaxman, A.: A spectral technique for random satisfiable 3CNF formulas. Proc. 14th SODA (2003) 357\u2013363."},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Friedman, J., Kahn, J., Szeme\u00e9di, E.: On the Second Eigenvalue in Random Regular Graphs. Proc. 21th STOC (1989) 587\u2013598.","DOI":"10.1145\/73007.73063"},{"key":"22_CR13","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF02579329","volume":"1","author":"Z. Fiiredi","year":"1981","unstructured":"Fiiredi, Z., Komlo\u015b, J.: The eigenvalues of random symmetric matrices. Combinatorica 1 (1981) 233\u2013241.","journal-title":"Combinatorica"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Giesen, J., Mitsche, D.: Reconstructing Many Partitions Using Spectral Techniques. Proe. 15th FCT (2005) 433 444.","DOI":"10.1007\/11537311_38"},{"key":"22_CR15","unstructured":"Husbands, P., Simon, H., and Ding, C.: On the use of the singular value decomposition for text retrieval. In 1st SIAM Computational Information Retrieval Workshop (2000), Raleigh, NC."},{"key":"22_CR16","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1017\/S0963548302005424","volume":"12","author":"M. Krivelevich","year":"2003","unstructured":"Krivelevich, M., Sudakov, B.: The largest eigenvalue of sparse random graphs. Combinatorics, Probability and Computing 12 (2003) 61\u201372.","journal-title":"Combinatorics, Probability and Computing"},{"key":"22_CR17","unstructured":"Krivelevich, M., Vu, V.H.: On the concentration of eigenvalues of random symmetric matrices. Microsoft Technical Report 60 (2000)."},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Lempel, R., Moran, S. 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 (2004) Kluwer.","DOI":"10.1007\/s10791-005-5661-0"},{"key":"22_CR19","unstructured":"Meila, M., Varna D.: A comparison of spectral clustering algorithms. UW CSE Technical report 03-05-01."},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"McSherry, F.: Spectral Partitioning of Random Graphs. Proc. 42nd FoGS (2001) 529\u2013537.","DOI":"10.1109\/SFCS.2001.959929"},{"key":"22_CR21","doi-asserted-by":"crossref","unstructured":"Mihail, M., Papadimitriou, C.H.: On the Eigenvalue Power Law. Proc. 6th RANDOM (2002) 254\u2013262.","DOI":"10.1007\/3-540-45726-7_20"},{"key":"22_CR22","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1137\/0611030","volume":"11","author":"A. Pothen","year":"1990","unstructured":"Pothen, A., Simon, H.D., Liou, K.-P.: Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl. 11 (1990) 430\u2013452","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"22_CR23","doi-asserted-by":"crossref","unstructured":"Spielman, D.A., Teng, S.-H.: Spectral partitioning works: planar graphs and finite element meshes. Proc. 36th FOCS (1996) 96\u2013105.","DOI":"10.1109\/SFCS.1996.548468"}],"container-title":["IFIP International Federation for Information Processing","Fourth IFIP International Conference on Theoretical Computer Science- TCS 2006"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-34735-6_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,9]],"date-time":"2023-05-09T23:50:38Z","timestamp":1683676238000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-34735-6_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387346335"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-34735-6_22","relation":{},"subject":[]}}