Skip to main content
SpringerLink
Log in

Basic Facts about Expander Graphs

  • Chapter
Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6650))

Abstract

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

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ajtai, M., Komlos, J., Szemerédi, E.: An O(nlogn) Sorting Network. In: 15th STOC, pp. 1–9 (1983)

    Google Scholar 

  2. Ajtai, M., Komlos, J., Szemerédi, E.: Deterministic Simulation in LogSpace. In: 19th STOC, pp. 132–140 (1987)

    Google Scholar 

  3. Alon, N.: Eigenvalues and expanders. Combinatorica 6, 83–96 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  MATH  Google Scholar 

  5. Alon, N., Milman, V.D.: λ 1, Isoperimetric Inequalities for Graphs and Superconcentrators, J. J. Combinatorial Theory, Ser. B 38, 73–88 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  6. Alon, N., Spencer, J.H.: The Probabilistic Method, 2nd edn. John Wiley & Sons, Chichester (1992, 2000)

    MATH  Google Scholar 

  7. Gabber, O., Galil, Z.: Explicit Constructions of Linear Size Superconcentrators. JCSS 22, 407–420 (1981)

    MATH  Google Scholar 

  8. Goldreich, O.: Computational Complexity: A Conceptual Perspective. Cambridge University Press, Cambridge (2008)

    Book  MATH  Google Scholar 

  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)

    Chapter  Google Scholar 

  10. Hoory, S., Linial, N., Wigderson, A.: Expander Graphs and their Applications. Bull. AMS 43(4), 439–561 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  11. Impagliazzo, R., Kabanets, V.: Constructive Proofs of Concentration Bounds. In: ECCC, TR10-072 (2010)

    Google Scholar 

  12. Kahale, N.: Eigenvalues and Expansion of Regular Graphs. JACM 42(5), 1091–1106 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  13. Lubotzky, A., Phillips, R., Sarnak, P.: Ramanujan Graphs. Combinatorica 8, 261–277 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  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. Reingold, O.: Undirected ST-Connectivity in Log-Space. In: 37th STOC, pp. 376–385 (2005)

    Google Scholar 

  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)

    Article  MATH  Google Scholar 

Download references

Authors
  1. Oded Goldreich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Mathematics and Computer Science, Weizmann Institute of Science, 76100, Rehovot, Israel

    Oded Goldreich

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Goldreich, O. (2011). Basic Facts about Expander Graphs. In: Goldreich, O. (eds) Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation. Lecture Notes in Computer Science, vol 6650. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22670-0_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22670-0_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22669-4

  • Online ISBN: 978-3-642-22670-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation