In this survey we review basic facts regarding expander graphs that are most relevant to the theory of computation.


Expander Graphs Random Walks on Graphs 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ajtai, M., Komlos, J., Szemerédi, E.: An O(nlogn) Sorting Network. In: 15th STOC, pp. 1–9 (1983)Google Scholar
  2. 2.
    Ajtai, M., Komlos, J., Szemerédi, E.: Deterministic Simulation in LogSpace. In: 19th STOC, pp. 132–140 (1987)Google Scholar
  3. 3.
    Alon, N.: Eigenvalues and expanders. Combinatorica 6, 83–96 (1986)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Alon, N., Bruck, J., Naor, J., Naor, M., Roth, R.: Construction of Asymptotically Good, Low-Rate Error-Correcting Codes through Pseudo-Random Graphs. IEEE Transactions on Information Theory 38, 509–516 (1992)CrossRefMATHGoogle Scholar
  5. 5.
    Alon, N., Milman, V.D.: λ 1, Isoperimetric Inequalities for Graphs and Superconcentrators, J. J. Combinatorial Theory, Ser. B 38, 73–88 (1985) MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Alon, N., Spencer, J.H.: The Probabilistic Method, 2nd edn. John Wiley & Sons, Chichester (1992, 2000)MATHGoogle Scholar
  7. 7.
    Gabber, O., Galil, Z.: Explicit Constructions of Linear Size Superconcentrators. JCSS 22, 407–420 (1981)MATHGoogle Scholar
  8. 8.
    Goldreich, O.: Computational Complexity: A Conceptual Perspective. Cambridge University Press, Cambridge (2008)CrossRefMATHGoogle Scholar
  9. 9.
    Healy, A.: Randomness-efficient sampling within NC1. In: Díaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX 2006 and RANDOM 2006. LNCS, vol. 4110, pp. 398–409. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  10. 10.
    Hoory, S., Linial, N., Wigderson, A.: Expander Graphs and their Applications. Bull. AMS 43(4), 439–561 (2006)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Impagliazzo, R., Kabanets, V.: Constructive Proofs of Concentration Bounds. In: ECCC, TR10-072 (2010)Google Scholar
  12. 12.
    Kahale, N.: Eigenvalues and Expansion of Regular Graphs. JACM 42(5), 1091–1106 (1995)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Lubotzky, A., Phillips, R., Sarnak, P.: Ramanujan Graphs. Combinatorica 8, 261–277 (1988)MathSciNetCrossRefMATHGoogle Scholar
  14. 14.
    Margulis, G.A.: Explicit Construction of Concentrators. Prob. Per. Infor. 9(4), 325–332 (1975) (in Russian); English translation in Problems of Infor. Trans. pp. 325–332 (1975)Google Scholar
  15. 15.
    Reingold, O.: Undirected ST-Connectivity in Log-Space. In: 37th STOC, pp. 376–385 (2005)Google Scholar
  16. 16.
    Reingold, O., Vadhan, S., Wigderson, A.: Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors. Annals of Mathematics 155(1), 157–187 (2001); Preliminary version in 41st FOCS, pp. 3–13 (2000)CrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Oded Goldreich

There are no affiliations available

Personalised recommendations