Eigenvalues and Expansion of Regular Graphs

Journal of the ACM (JACM)

Volumn 42, Issue 5, 1995, Pages 1091-1106

  Kahale, Nabil ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Eigenvalues; expander graphs; induced subgraphs; load balancing; Ramanujan graphs; random walks; selection networks

Indexed keywords

EID: 84976736925     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/210118.210136     Document Type: Article

References (33)

1. Ajtai, M., Koml6S, J., And Szemeredi, E. 1983. Sorting in c log n parallel steps. Combinatorial 3, 1–19.
2. Ajtai, M., Koml6S, J., And Szemeredi, E. 1987. Deterministic simulation in LOGSPACE. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing (New York, N.Y., May 25–27). ACM, New York, pp. 132–140.
3. Aeon, N. 1986. Eigenvalues and expanders. Combinatorica 6, 2, 83–96.
4. Alon, N„ And Chung, F. R. K. 1988. Explicit construction of linear sized tolerant networks. Disc. Math. 72. 15–19.
5. Aeon, N., Gaul, Z., And Milman, V. D. 1987. Better expanders and superconcentrators. J. Algorithms 8, 337–347.
6. Alon, N., And Milman, V. D. 1985. Aj, isoperimetric inequalities for graphs and superconcentrators. J. Comb. Theory Ser. B 38, 73–88.
7. Arora, S., Leighton, T., And Maggs, B. 1990. Oe-line algorithms for path selection in a nonblocking network. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (Baltimore, Md., May 12–14). ACM, New York, pp. 149–158. Bellare, M, Goldreich, O., And Goldwasser, S. 1990. Randomness in interactive proofs. In Proceedings of the 31st Annual Symposium on Foundations of Computer Science. IEEE, New York, pp. 563–572.
8. Bien, F. 1989. Constructions of telephone networks by group representations. Notices Amer. Math Soc. 36, 1, 5–22.
9. Bollobas, B. 1990.Graph Theory. Springer-Verlag, New York.
10. Broder, A. Z., Frieze, A. M., Shamir, E., And Upfal, E., 1992. Near-perfect token distribution. In Proceedings of the 19th International Colloquium on Automata, Languages, and Programming. Springer-Verlag, Berlin, Germany, pp. 308–317.
11. Buck, M. W. 1986. Expanders and diffusers, SIAM J. Algebraic Disc. Meth. 7, 2, 282–304.
12. Friedman, J. 1991. On the second eigenvalue and random walks in random regular graphs. Combinatorica 77, 4, 331–362.
13. Friedman, J. 1991. Some geometric aspects of graphs and their eigenfunctions. Tech. Rep. Dept. Computer Science, Princeton Univ., Princeton, N.J.
14. Gabber, O., And Galil, Z, 1981. Explicit constructions of linear sized superconcentrators, J. Comput. System Sci. 22, 3, 407–420.
15. Goldreich, O, Impagliazzo, R., Levin, L., Venkatesan, R., And Zuckerman, D. 1990. Security preserving amplification of hardness. In Proceedings of the 31st Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, New York, pp. 318–326.
16. Jimbo, S., And Maruoka, A. 1987. Expanders obtained from affine transformations. Combinatorica 7, 4, 343–355.
17. Kahale, N. 1991. Better expansion for Ramanujan Graphs. In Proceedings of the 32nd Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, New York, pp. 296–303.
18. Kahale, N. 1993. On the second eigenvalue and linear expansion of regular graphs. In DIMACS Series in Discrete Mathematics and Theoretical Computer Science 10, 49–62.
19. Kahale, N. 1993. Expander Graphs. Ph.D. dissertation, MIT Laboratory for Computer Science, Tech. Rep. MIT/LCS/TR-591. Massachusetts Institute of Technology. Cambridge, Mass.
20. Leighton, T., And Maggs, B. 1989. Fast algorithms for routing around faults on multibutter-flies. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science. IEEE, New York.
21. Lubotzky, A. Discrete groups, expandings graphs and invariant measures. To appear.
22. Lubotzkv, A., Phillips, R., And Sarnak, P. 1988. Ramanujan graphs. Combinatorica 8, 3, 261–277.
23. Margulis, G. A. 1973. Explicit constructions of concentrators. Prob. Peredacilnf. 9, 4, 71–80.
24. Margulis, G. A. 1988. Explicit group-theoretical constructions of combinatorial schemes and their applications to the design of expanders and concentrators. Prob. Peredaci Inf. 24, 1, 51–60.
25. Nilli, A. 1991. On the second eigenvalue of a graph. Disc. Math. 91, 207–210.
26. Pippinger, N. 1991. Selection networks. SIAM J. Comput. 20, 5, 878–887.
27. Pippinger, N. 1993. Self-routing superconcentrators. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing (San Diego, Calif., May 16–18). ACM, New York, pp. 355–361.
28. Sarnak, P. 1990, Some applications of modular forms. Cambridge University Press. Cambridge, Mass.
29. Seneta, E. 1981.Non-negative matrices and Markov chains, Springer-Verlag, New York.
30. Strang, G. 1988. Linear Albegra and its Applications. Harcourt Brace Jovanovich, San Diego.
31. Tanner, R.M. 1984. Explicit construction of concentrators from generalized n-gons. SIAM J. Algebraic Disc. Meth. 5, 3, 287–294.
32. Upfal, E. 1989. An Odog n) deterministic packet routing scheme. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing (Seattle, Wash., May 15–17). ACM, New York, pp. 241–250.
33. Valiant, L. 1976, Graph theoretic properties in computational complexity. J. Comput Syst. Sci. 13, 278–285.