Abstract
It is a well established fact, that—in the case of classical random graphs like (variants of) G n,p or random regular graphs-spectral methods yield efficient algorithms for clustering (e. g. coiouring or bisection) problems. The theory of large networks emerging recently provides convincing evidence that such networks, albeit looking random in some sense, cannot sensibly be described by classical random graphs. A variety of new types of random graphs have been introduced. One of these types is characterized by the fact that we have a fixed expected degree sequence, that is for each vertex its expected degree is given.
Recent theoretical work confirms that spectral methods can be successfully applied to clustering problems for such random graphs, too—provided that the expected degrees are not too small, in fact≥log6 n. In this case however the degree of each vertex is concentrated about its expectation. We show how to remove this restriction and apply spectral methods when the expected degrees are bounded below just by a suitable constant. Our results rely on the observation that techniques developed for the classical sparse G n,p random graph (that is p=c/n) can be transferred to the present situation, when we consider a suitably normalized adjacency matrix: We divide each entry of the adjacency matrix by the product of the expected degrees of the incident vertices. Given the host of spectral techniques developed for G n,p this observation should be of independent interest.
Please use the following format when citing this chapter: Coja-Oghlan, A., Goerdt, A., Lanka, A., 2006, in International Federation for Information Processing, Volume 209, Fourth IFIP International Conference on Theoretical Computer Science-TCS 2006, eds. Navarro, G., Bertossi, L., Kohayakwa, Y., (Boston: Springer), pp. 271–282.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Aiello, W, Chung, F., Lu, L.: A random graph model for massive graphs. Proc. 33rd. SToC (2001), 171–180.
Alon, N. Spectral techniques in graph algorithms. Proc. LATIN (1998), LNCS 1380, Springer, 206–215.
Alon, N., Kahale, N.: A spectral technique for coloring random 3-colorable graphs. SIAM J. Comput. 26 (1997) 1733–1748.
Boppana, R.B.: Eigenvalues and graph bisection: An average case analysis. Proc. 28th FoCS (1987), 280–285.
Chung, F.K.R.: Spectral Graph Theory. American Mathematical Society (1997).
Coja-Oghlan, A.: On the Laplacian eigenvalues of G n,p . Preprint (2005) http://www.informatik.hu-berlin.de/~coja/de/publikation.php.
Coja-Oghlan, A., Lanka, A.: The Spectral Gap of Random Graphs with Given Expected Degrees. Preprint (2006).
Chung, F.K.R., Lu, L., Vu, V.: The Spectra of Random Graphs with Given Expected Degrees. Internet Mathematics 1 (2003) 257–275.
Dasgupta, A., Hopcroft, J.E., McSherry, F.: Spectral Analysis of Random Graphs with Skewed Degree Distributions. Proc. 45th FOCS (2004) 602–610.
Feige, U., Ofek, E.: Spectral Techniques Applied to Sparse Random Graphs. Random Structures and Algorithms, 27(2) (2005), 251–275.
Flaxman, A.: A spectral technique for random satisfiable 3CNF formulas. Proc. 14th SODA (2003) 357–363.
Friedman, J., Kahn, J., Szemeédi, E.: On the Second Eigenvalue in Random Regular Graphs. Proc. 21th STOC (1989) 587–598.
Fiiredi, Z., Komloś, J.: The eigenvalues of random symmetric matrices. Combinatorica 1 (1981) 233–241.
Giesen, J., Mitsche, D.: Reconstructing Many Partitions Using Spectral Techniques. Proe. 15th FCT (2005) 433 444.
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.
Krivelevich, M., Sudakov, B.: The largest eigenvalue of sparse random graphs. Combinatorics, Probability and Computing 12 (2003) 61–72.
Krivelevich, M., Vu, V.H.: On the concentration of eigenvalues of random symmetric matrices. Microsoft Technical Report 60 (2000).
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.
Meila, M., Varna D.: A comparison of spectral clustering algorithms. UW CSE Technical report 03-05-01.
McSherry, F.: Spectral Partitioning of Random Graphs. Proc. 42nd FoGS (2001) 529–537.
Mihail, M., Papadimitriou, C.H.: On the Eigenvalue Power Law. Proc. 6th RANDOM (2002) 254–262.
Pothen, A., Simon, H.D., Liou, K.-P.: Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl. 11 (1990) 430–452
Spielman, D.A., Teng, S.-H.: Spectral partitioning works: planar graphs and finite element meshes. Proc. 36th FOCS (1996) 96–105.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 International Federation for Information Processing
About this paper
Cite this paper
Coja-Oghlan, A., Goerdt, A., Lanka, A. (2006). Spectral Partitioning of Random Graphs with Given Expected Degrees. In: Navarro, G., Bertossi, L., Kohayakawa, Y. (eds) Fourth IFIP International Conference on Theoretical Computer Science- TCS 2006. IFIP International Federation for Information Processing, vol 209. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-34735-6_22
Download citation
DOI: https://doi.org/10.1007/978-0-387-34735-6_22
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-34633-5
Online ISBN: 978-0-387-34735-6
eBook Packages: Computer ScienceComputer Science (R0)