The Evolution of Expander Graphs

Acknowledgements First and foremost I'd like to thank my advisor Prof. Salil Vadhan for many fruitful discussions and for his support and guidance. Many thanks to Prof. Michael Rabin and Minh-Huyen Nguyen for their encouragement and help in the editing process. And my deepest gratitude to my parents for giving me the opportunity to reach this point. All that I've accomplished is because of you.

[1]  Noga Alon,et al.  On the second eigenvalue of a graph , 1991, Discret. Math..

[2]  R. M. Tanner.  Explicit Concentrators from Generalized N-Gons , 1984 .

[3]  Nabil Kahale,et al.  Eigenvalues and expansion of regular graphs , 1995, JACM.

[4]  Joel Friedman,et al.  A proof of Alon's second eigenvalue conjecture and related problems , 2004, ArXiv.

[5]  F. Chung.  On concentrators, superconcentrators, generalizers, and nonblocking networks , 1979, The Bell System Technical Journal.

[6]  Avi Wigderson,et al.  Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[7]  Oded Goldreich,et al.  A Sample of Samplers - A Computational Perspective on Sampling (survey) , 1997, Electron. Colloquium Comput. Complex..

[8]  Daniel A. Spielman,et al.  Expander codes , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[9]  M. Rabin.  Probabilistic algorithm for testing primality , 1980 .

[10]  N. Alon,et al.  il , , lsoperimetric Inequalities for Graphs , and Superconcentrators , 1985 .

[11]  Manindra Agrawal,et al.  PRIMES is in P , 2004 .

[12]  M. Minerva.  Semi-direct product in groups and Zig-zag product in graphs: Connections and applications , 2002 .

[13]  Zvi Galil,et al.  Explicit Constructions of Linear-Sized Superconcentrators , 1981, J. Comput. Syst. Sci..

[14]  L. M. Milne-Thomson.  Methoden der mathematischen Physik , 1944, Nature.

[15]  M. Pinsker,et al.  On the complexity of a concentrator , 1973 .

[16]  János Komlós,et al.  Sorting in c log n parallel sets , 1983, Comb..

[17]  Russell Impagliazzo,et al.  How to recycle random bits , 1989, 30th Annual Symposium on Foundations of Computer Science.

[18]  Oliver Vornberger,et al.  The Complexity of Testing Whether a Graph is a Superconcentrator , 1981, Inf. Process. Lett..

[19]  E. Wigner.  On the Distribution of the Roots of Certain Symmetric Matrices , 1958 .

[20]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[21]  Leslie G. Valiant,et al.  Graph-Theoretic Properties in computational Complexity , 1976, J. Comput. Syst. Sci..

[22]  Zvi Galil,et al.  NP Completeness of Finding the Chromatic Index of Regular Graphs , 1983, J. Algorithms.

[23]  M. Murty.  Ramanujan Graphs , 1965 .

[24]  Akira Maruoka,et al.  Expanders obtained from affine transformations , 1985, STOC '85.