Abstract
We deal with two very related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph “resembles” a random one. Moreover, a regular partition approximates a given graph by a bounded number of quasi-random graphs. Regarding quasi-randomness, we present a new spectral characterization of low discrepancy, which extends to sparse graphs. Concerning regular partitions, we present a novel concept of regularity that takes into account the graph’s degree distribution, and show that if G = (V,E) satisfies a certain boundedness condition, then G admits a regular partition. In addition, building on the work of Alon and Naor [4], we provide an algorithm that computes a regular partition of a given (possibly sparse) graph G in polynomial time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Albert, R., Barabási, A.L.: Statistical mechanics of complex networks. Reviews of modern physics 74, 47–97 (2002)
Alizadeh, F.: Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM J. Optimization 5, 13–51 (1995)
Alon, N., Duke, R.A., Rödl, V., Yuster, R.: The algorithmic aspects of the regularity lemma. J. of Algorithms 16, 80–109 (1994)
Alon, N., Naor, A.: Approximating the cut-norm via Grothendieck’s inequality. In: Proc. 36th STOC, pp. 72–80 (2004)
Bilu, Y., Linial, N.: Lifts, discrepancy and nearly optimal spectral gap. Combinatorica (to appear)
Butler, S.: On eigenvalues and the discrepancy of graphs. preprint
Chung, F., Graham, R.: Quasi-random graphs with given degree sequences. Preprint (2005)
Chung, F., Graham, R.: Sparse quasi-random graphs. Combinatorica 22, 217–244 (2002)
Chung, F., Graham, R., Wilson, R.M.: Quasi-random graphs. Combinatorica 9, 345–362 (1989)
Frieze, A., Kannan, R.: Quick approximation to matrices and applications. Combinatorica 19, 175–200 (1999)
Gerke, S., Steger, A.: A characterization for sparse ε-regular pairs. The Electronic J. Combinatorics 14, 4–12 (2007)
Grothendieck, A.: Résumé de la théorie métrique des produits tensoriels topologiques. Bol. Soc. Mat. Sao Paulo 8, 1–79 (1953)
Grötschel, M., Lovász, L., Schrijver, A.: Geometric algorithms and combinatorial optimization. Springer, Heidelberg (1988)
Håstad, J.: Some optimal inapproximability results. J. of the ACM 48, 798–859 (2001)
Kohayakawa, Y.: Szemeredi’s regularity lemma for sparse graphs. In: Cucker, F., Shub, M. (eds.) Foundations of computational mathematics, pp. 216–230 (1997)
Kohayakawa, Y., Rödl, V., Thoma, L.: An optimal algorithm for checking regularity. SIAM J. Comput. 32, 1210–1235 (2003)
Krivine, J.L.: Sur la constante de Grothendieck. C. R. Acad. Sci. Paris Ser. A-B 284, 445–446 (1977)
Szemeredi, E.: Regular partitions of graphs. Problémes Combinatoires et Théorie des Graphes Colloques Internationaux CNRS 260, 399–401 (1978)
Trevisan, L., Sorkin, G., Sudan, M., Williamson, D.: Gadgets, approximation, and linear programming. SIAM J. Computing 29, 2074–2097 (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alon, N., Coja-Oghlan, A., Hàn, H., Kang, M., Rödl, V., Schacht, M. (2007). Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds) Automata, Languages and Programming. ICALP 2007. Lecture Notes in Computer Science, vol 4596. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73420-8_68
Download citation
DOI: https://doi.org/10.1007/978-3-540-73420-8_68
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73419-2
Online ISBN: 978-3-540-73420-8
eBook Packages: Computer ScienceComputer Science (R0)