Constructing expander graphs by 2-lifts and discrepancy vs. spectral gap

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2004, Pages 404-412

  Bilu, Yonatan ^a   Linial, Nathan ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Discrepancy; Expander Graphs; Lifts; Lifts of Graphs; Signed Graphs

Indexed keywords

ALGEBRA; DISCRETE TIME CONTROL SYSTEMS; EIGENVALUES AND EIGENFUNCTIONS; MATHEMATICAL MODELS; POLYNOMIALS; RANDOM PROCESSES; THEOREM PROVING;

DISCRETE MATHEMATICS; EXPANDER GRAPHS; OPTIMAL SPECTRAL GAP; ZIG-ZAG PRODUCT;

GRAPH THEORY;

EID: 17744375416     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)

1. M. Ajtai. Recursive construction for 3-regular expanders. Combinatorica, 14(4):379-416, 1994.
2. N. Alon. Personal communication.
3. N. Alon. Eigenvalues and expanders. Combinatorica, 6(2):83-96, 1986. Theory of computing (Singer Island, Fla., 1984).
4. N. Alon. A parallel algorithmic version of the local lemma. Random Structures Algorithms, 2(4):367-378, 1991.
5. N. Alon, Z. Galil, and V. D. Milman. Better expanders and superconcentrators. J. Algorithms, 8(3):337-347, 1987.
6. N. Alon, O. Goldreich, J. Håstad, and R. Peralta. Simple constructions of almost k-wise independent random variables. In 31st Annual Symposium on Foundations of Computer Science, Vol. I. II (St. Louis, MO, 1990), pages 544-553. IEEE Comput. Soc. Press, Los Alamitos, CA, 1990.
7. 1, isoperimetric inequalities for graphs, and superconcentrators. J. Combin. Theory Ser. B, 38(1):73-88, 1985.
8. N. Alon and J. H. Spencer. The probabilistic method. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience [John Wiley & Sons], New York, second edition, 2000. With an appendix on the life and work of Paul Erdo″s.
9. A. Amit and N. Linial. Random graph coverings. I. General theory and graph connectivity. Combinatorica, 22(1):1-18, 2002.
10. A. Amit and N. Linial. Random lifts of graphs II: Edge expansion. To appear in Combinatorics Probability and Computing, 2003.
11. A. Amit, N. Linial, and J. Matoušek. Random lifts of graphs: independence and chromatic number. Random Structures Algorithms, 20(1): 1-22, 2002.
12. A. Broder and E. Shamir. On the second eigenvalue of random regular graphs. In 28th Annual Symposium on Foundations of Computer Science, October 12-14, 1987, Los Angeles, California, pages 286-294. IEEE Comput. Soc. Press, 1987.
13. P. Erdo″s and L. Lovász. Problems and results on 3-chromatic hypergraphs and some related questions. In Infinite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erdo″s on his 60th birthday), Vol. II, pages 609-627. Colloq. Math. Soc. János Bolyai, Vol. 10. North-Holland, Amsterdam, 1975.
14. J. Friedman. A proof of alon's second eigenvalue conjecture, manuscript.
15. J. Friedman. On the second eigenvalue and random walks in random d-regular graphs. Combinatorica, 11(4):331-362, 1991.
16. J. Friedman. Relative expanders or weakly relatively Ramanujan graphs. Duke Math. J., 118(1):19-35, 2003.
17. J. Friedman, J. Kahn, and E. Szemeredi. On the second eigenvalue of random regular graphs. In Proceedings of the twenty-first annual ACM symposium on Theory of computing, pages 587-598. ACM Press, 1989.
18. A. M. Frieze and M. Molloy. Splitting an expander graph. J. Algorithms, 33(1): 166-172, 1999.
19. O. Gabber and Z. Galil. Explicit constructions of linear-sized superconcentrators. J. Comput. System Sci., 22(3):407-420, 1981. Special issued dedicated to Michael Machtey.
20. D. E. Knuth. The art of computer programming. Vol. 1: Fundamental algorithms. Second printing. Addison-Wesley Publishing Co., Reading, Mass.-London-Don Mills, Ont, 1969.
21. N. Linial and E. Rozenman. Random lifts of graphs: Perfect matchings. To appear in Combinatorica.
22. N. Linial and A. Wigderson. Expander graphs and their applications. Lecture notes available at http://www.math.ias.edu/~boaz/ExpanderCourse/.
23. A. Lubotzky, R. Phillips, and P. Sarnak. Ramanujan graphs. Combinatorica, 8(3):261-277, 1988.
24. G. A. Margulis. Explicit constructions of expanders. Problemy Peredači Informacii, 9(4):71-80, 1973.
25. G. A. Margulis. Explicit group-theoretic constructions of combinatorial schemes and their applications in the construction of expanders and concentrators, Problemy Peredachi Informatsii, 24(1):51-60, 1988.
26. J. Naor and M. Naor. Small-bias probability spaces: efficient constructions and applications. SIAM J. Comput., 22(4):838-856, 1993.
27. A. Nilli. On the second eigenvalue of a graph. Discrete Math., 91(2):207-210, 1991.
28. O. Reingold, S. Vadhan, and A. Wigderson. Entropy waves, the zig-zag graph product, and new constant-degree expanders. Ann. of Math. (2), 155(1):157-187, 2002.