Expander graphs and their applications

Bulletin of the American Mathematical Society

Volumn 43, Issue 4, 2006, Pages 439-561

  Hoory, Shlomo ^a   Linial, Nathan ^b   Wigderson, Avi ^c  

^a IBM HAIFA RESEARCH LAB   (Israel)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^c INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33749002225     PISSN: 02730979     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0273-0979-06-01126-8     Document Type: Article

References (190)

1. [ABN92] N. Alon, J. Bruck, J. Naor, M. Naor, and R. M. Roth. Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. IEEE Transactions on Information Theory, 38(2):509-516, 1992.
2. [ABSRW04] M. Alekhnovich, E. Ben-Sasson, A. A. Razborov, and A. Wigderson. Pseudorandom generators in prepositional proof complexity. SIAM J. Comput., 34(1):67-88 (electronic), 2004. MR2114305 (2006a:03078)
3. [AC89] N. Alon and F. R. K. Chung. Explicit construction of linear sized tolerant networks, Discrete Math., 72:15-19, 1989. MR0975519 (90f:05080)
4. [AC02] N. Alon and M. Capalbo. Explicit unique-neighbor expanders. In 43nd IEEE Symposium on Foundations of Computer Science (Vancouver, BC), pages 73-79. IEEE Computer Society. 2002.
5. [AC04] N. Alon and M. Capalbo. Smaller explicit superconcentrators. Internet Math., 1(2):151-163, 2004. MR2077222 (2006a:05140)
6. [AFH] O. Angel, J. Friedman, and S. Hoory. The non-backtracking spectrum of the universal cover of a graph. Manuscript.
7. [AFWZ95] N. Alon, U. Feige, A. Wigderson, and D. Zuckerman. Derandomized graph products. Comput. Complexity, 5(1):60-75, 1995. MR1319493 (95m:68082)
8. [AKL79] R. Aleliunas, R. M. Karp, R. J. Lipton, L. Lovász, and C. Rackoff. Random walks, universal traversal sequences, and the complexity of maze problems. In 20th Annual Symposium on Foundations of Computer Science (San Juan, Puerto Rico, 1979), pages 218-223. IEEE, New York, 1979. MR0598110 (82h:68084)
9. [AKS83] M. Ajtai, J. Komlós, and E. Szemerédi. An O(nlogra) sorting network. Combinatorica, 3(1):1-19, 1983.
10. [AKS87] M. Ajtai, J. Komlós, and E. Szemerédi. Deterministic simulation in LOGSPACE. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pages 132-140, 1987.
11. [AL06] A. Amit and N. Linial. Random lifts of graphs II: Edge expansion. Combinatorics Probability and Computing, 15:317-332, 2006. MR2216470
12. [AL96] S. Arora and C. Lund. Hardness of approximations. In D. S. Hochbaum, editor, Approximation Algorithms for NP-hard Problems. PWS Publishing Company, Boston, MA, 1996.
13. [AL02] A. Amit and N. Linial. Random graph coverings. I. General theory and graph connectivity. Combinatorica, 22(1):1-18, 2002. MR1883559 (2003a:05131)
14. [ALM96] S. Arora, F. T. Leighton, and B. M. Maggs. On-line algorithms for path selection in a nonblocking network. SIAM J. Comput., 25(3):600-625, 1996. MR1390029 (97b:68014)
15. [ALM98] S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. J. ACM, 45(3):501-555, 1998.
16. Also in FOCS, 1992. MR1639346 (99d:68077b)
17. [ALM02] A. Amit, N. Linial, and J. Matoušek. Random lifts of graphs: independence and chromatic number. Random Structures Algorithms, 20(1):1-22, 2002. MR1871947 (2003a:05132)
18. [Alo86] N. Alon. Eigenvalues and expanders. Combinatorica, 6(2):83-96, 1986.
19. Theory of Computing (Singer Island, FL, 1984). MR0875835 (88e:05077)
20. [Alo97] N. Alon. On the edge-expansion of graphs. Combin. Probab. Comput., 6(2):145-152, 1997. MR1447810 (98c:05084)
21. [ALW01] N. Alon, A. Lubotzky, and A. Wigderson. Semi-direct product in groups and zig-zag product in graphs: connections and applications (extended abstract). In 42nd IEEE Symposium on Foundations of Computer Science (Las Vegas, NV, 2001), pages 630-637. IEEE Computer Society, 2001. MR1948752
22. [AM85] N. Alon and V. D. Milman. AI, isoperimetric inequalities for graphs, and superconcentrators. J. Combin. Theory Ser. B, 38(1):73-88, 1985. MR0782626 (87b:05092)
23. [AR94] N. Alon and Y. Roichman. Random Cayley graphs and expanders. Random Structures Algorithms, 5(2):271-284, 1994. MR1262979 (94k:05132)
24. [AR01] M. Alekhnovich and A. A. Razborov. Lower bounds for polynomial calculus: nonbinomial case. In 42nd IEEE Symposium on Foundations of Computer Science (Las Vegas, NV, 2001), pages 190-199. IEEE Computer Society, 2001. MR1948707
25. [ARV04] S. Arora, S. Rao, and U. Vazirani. Expander flows, geometric embeddings and graph partitioning. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pages 222-231, 2004. MR2121604 (2005j:68081)
26. [AS98] S. Arora and S. Safra. Probabilistic checking of proofs: a new characterization of NP. J. ACM, 45(1):70-122, 1998.
27. Also in FOCS, 1992. MR1614328 (99d:68077a)
28. [AS00] 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 Erdos. MR1885388 (2003f:60003)
29. 1. In 44nd IEEE Symposium on Foundations of Computer Science (Cambridge, MA), pages 514-523. IEEE Computer Society, 2003.
30. [BCCF05] K. Burgin, P. Chebolu, C. Cooper, and A.M. Frieze. Hamilton cycles in random lifts of graphs. Preprint at http://www.math.cmu.edu/~af1p/ papers.html, 2005.
31. [Bec75] William Beckner. Inequalities in Fourier analysis. Ann. of Math. (2), 102(1):159-182, 1975. MR0385456 (52:6317)
32. [BFU99] A. Z. Broder, A. M. Frieze, and E. Upfal. Static and dynamic path selection on expander graphs: a random walk approach. Random Structures Algorithms, 14(1):87-109, 1999. MR1662203 (99m:05144)
33. [BH04] Y. Bilu and S. Hoory. On codes from hypergraphs. European J. Combin., 25(3):339-354, 2004. MR2036471 (2005d:94200)
34. [BKV81] M. Blum, R. M. Karp, O. Vornberger, C. H. Papadimitriou, and M. Yannakakis. The complexity of testing whether a graph is a superconcentrator. Inform. Process. Lett., 13(4-5):164-167, 1981. MR0651465 (84f:68031)
35. [BL] Y. Bilu and N. Linial. Lifts, discrepancy and nearly optimal spectral gaps. Combinatorica, to appear.
36. [BMRV02] H. Buhrman, P. B. Miltersen, J. Radhakrishnan, and S. Venkatesh. Are bitvectors optimal? SIAM J. Comput., 31(6):1723-1744 (electronic), 2002. MR1954872 (2004a:68014)
37. [BOGH03] J. Buresh-Oppenheim, N. Galesi, S. Hoory, A. Magen, and T. Pitassi. Rank bounds and integrality gaps for cutting planes procedures. In 44nd IEEE Symposium on Foundations of Computer Science (Cambridge, MA, 2003), pages 318-327. IEEE Computer Society, 2003.
38. [Bo186] B. Bollobás. Combinatorics. Cambridge University Press, Cambridge, 1986. Set systems, hypergraphs, families of vectors and combinatorial probability. MR0866142 (88g:05001)
39. p(G). Ann. Inst. Fourier (Grenoble), 20(fasc. 2):335-402 (1971), 1970. MR0283496 (44:727)
40. [Bou85] J. Bourgain. On Lipschitz embedding of finite metric spaces in Hilbert space. Israel J. Math., 52(1-2):46-52, 1985. MR0815600 (87b:46017)
41. [BP73] L. A. Bassalygo and M. S. Pinsker. The complexity of an optimal non-blocking commutation scheme without reorganization. Problemy Peredači Informacii, 9(1):84-87, 1973.
42. Translated into English in Problems of Information Transmission, 9 (1974) 64-66. MR0327387 (48:5729)
43. [BS87] A. Broder and E. Shamir. On the second eigenvalue of random regular graphs. In The 28th Annual Symposium on Foundations of Computer Science, pages 286-294, 1987.
44. [BS92] P. Berman and G. Schnitger. On the complexity of approximating the independent set problem. Inform, and Comput., 96(1):77-94, 1992. MR1142227 (92k:90110)
45. [BSW01] Eli Ben-Sasson and Avi Wigderson. Short proofs are narrow-resolution made simple. J. ACM, 48(2): 149-169, 2001. MR1868713 (2002j:03066)
46. [Bus82] P. Buser. A note on the isoperimetric constant. Ann. Sci. École Norm. Sup. (4), 15(2):213-230, 1982. MR0683635 (84e:58076)
47. [BZ88] Yu. D. Burago and V. A. Zalgaller. Geometric inequalities, volume 285 of Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]. Springer-Verlag, Berlin, 1988.
48. Translated from the Russian by A. B. Sosinskiǐ, Springer Series in Soviet Mathematics. MR0936419 (89b:52020)
49. [Cam] P. J. Cameron. A Markov chain for Steiner triple systems. Manuscript.
50. [Car72] P. Cartier. Fonctions harmoniques sur un arbre. In Symposia Mathematica, Vol. IX (Convegno di Calcolo delle Probabilità, INDAM, Rome, 1971), pages 203-270. Academic Press, London, 1972. MR0353467 (50:5950)
51. [Che70] J. Cheeger. A lower bound for the smallest eigenvalue of the Laplacian. In Problems in analysis (Papers dedicated to Salomon Bochner, 1969), pages 195-199. Princeton Univ. Press, Princeton, NJ, 1970. MR0402831 (53:6645)
52. [Cio06] S. M. Cioabǎ. On the extreme eigenvalues of regular graphs. Journal of Combinatorial Theory, Ser. B, 96(3):367-373, 2006. MR2220665
53. [CKK05] S. Chawla, R. Krauthgamer, R. Kumar, Y. Rabani, and D. Sivakumar. On the hardness of approximating multicut and sparsest-cut. In IEEE Conference on Computational Complexity, 2005.
54. [CLRS01] T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to algorithms. MIT Press, Cambridge, MA, second edition, 2001. MR1848805 (2002e:68001)
55. [CRVW02] M. Capalbo, O. Reingold, S. Vadhan, and A. Wigderson. Randomness conductors and constant-degree lossless expanders. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pages 659-668, 2002. MR2121193
56. [CT65] J. W. Cooley and J. W. Tukey. An algorithm for the machine calculation of complex Fourier series. Math. Comp., 19:297-301, 1965. MR0178586 (31:2843)
57. [DDPW83] D. Dolev, C. Dwork, N. Pippenger, and A. Wigderson. Superconcentrators, generalizers and generalized connectors with limited depth. In Proceedings of the 15th Annual ACM Symposium on Theory of Computing, pages 42-51, 1983.
58. [Die97] R. Diestel. Graph theory, volume 173 of Graduate Texts in Mathematics. Springer-Verlag, New York, 1997. Translated from the 1996 German original. MR1411445
59. [DL] Y. Drier and N. Linial. Minors in lifts of graphs. Random Structures and Algorithms, to appear.
60. [DL97] M. M. Deza and M. Laurent. Geometry of cuts and metrics, volume 15 of Algorithms and Combinatorics. Springer-Verlag, Berlin, 1997. MR1460488 (98g:52001)
61. [Dod84] J. Dodziuk. Difference equations, isoperimetric inequality and transience of certain random walks. Trans. Amer. Math. Soc., 284(2):787-794, 1984. MR0743744 (85m:58185)
62. [DSV03] G. Davidoff, P. Sarnak, and A. Valette. Elementary number theory, group theory, and Ramanujan graphs, volume 55 of London Mathematical Society Student Texts. Cambridge University Press, Cambridge, 2003. MR1989434 (2004f: 11001)
63. [ER59] P. Erdos and A. Rényi. On random graphs. I. Publ. Math. Debrecen, 6:290-297, 1959. MR0120167 (22:10924)
64. [Fel68] W. Feller. An introduction to probability theory and its applications. Vol. I. Third edition. John Wiley &: Sons Inc., New York, 1968. MR0228020 (37:3604)
65. [FGL91] U. Feige, S. Goldwasser, L. Lovász, S. Safra, and M. Szegedy. Approximating clique is almost np-complete. In 32nd IEEE Symposium on Foundations of Computer Science, pages 2-12. IEEE Computer Society, 1991.
66. [FK81] Z. Füredi and J. Komlós. The eigenvalues of random symmetric matrices. Combinatorica, 1(3):233-241, 1981. MR0637828 (83e:15010)
67. [FKS89] J. Friedman, J. Kahn, and E. Szemeredi. On the second eigenvalue of random regular graphs. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pages 587-598, 1989.
68. [Fri] J. Friedman. A proof of Alon's second eigenvalue conjecture. Memoirs of the A.M.S., to appear.
69. [Fri91] J. Friedman. The spectra of infinite hypertrees. SIAM J. Comput., 20(5):951-961, 1991. MR1115660 (92k:05096)
70. [Fri93] J. Friedman. Some geometric aspects of graphs and their eigenfunctions. Duke Math. J., 69(3):487-525, 1993. MR1208809 (94b:05134)
71. [Fri03] J. Friedman. Relative expanders or weakly relatively Ramanujan graphs. Duke Math. J., 118(1):19-35, 2003. MR1978881 (2004m:05165)
72. [FW95] Joel Friedman and Avi Wigderson. On the second eigenvalue of hypergraphs. Combinatorial, 15(1):43-65, 1995. MR1325271 (96b:05110)
73. [Gal6 3] R. G. Gallager. Low Density Parity Check Codes. MIT Press, Cambridge, MA, 1963. MR0136009 (24:B2048)
74. [GG81] O. Gabber and Z. Galil. Explicit constructions of linear-sized superconcentrators. J. Comput. System Sci., 22(3):407-420, 1981. Special issue dedicated to Michael Machtey. MR0633542 (83d:94029)
75. [Gil98] D. Gillman. A Chernoff bound for random walks on expander graphs. SIAM J. Comput., 27(4):1203-1220 (electronic), 1998. MR1621958 (99e:60076)
76. [GLS93] M. Grötschel, L. Lovász, and A. Schrijver. Geometric algorithms and combinatorial optimization, volume 2 of Algorithms and Combinatorics. Springer-Verlag, Berlin, second edition, 1993. MR1261419 (95e:90001)
77. [Gol97] O. Goldreich. A sample of samplers - a computational perspective on sampling (survey). Technical Report TR97-020, Electronic Colloquium on Computational Complexity (ECCC), 1997. http://www.eccc.uni-trier.de/eccc/.
78. [Gra05] A. Granville. It is easy to determine whether a given integer is prime. Bull. Amer. Math. Soc. (N.S.), 42(1):3-38 (electronic), 2005. MR2115065 (2005k:11011)
79. [Gre95] Y. Greenberg. On the Spectrum of Graphs and Their Universal Covering. PhD thesis, Hebrew University of Jerusalem, 1995 (in Hebrew).
80. [Gro77] J. L. Gross. Every connected regular graph of even degree is a Schreier coset graph. J. Combinatorial Theory Ser. B, 22(3):227-232, 1977. MR0450121 (56:8419)
81. [Gro83] M. Gromov. Filling Riemannian manifolds. J. Differential Geom., 18(1):1-147, 1983. MR0697984 (85h:53029)
82. [Gro03] M. Gromov. Random walk in random groups. Geom. Funct. Anal., 13(1):73-146, 2003. MR1978492 (2004j:20088a)
83. 1-ε. Acta Math., 182(1):105-142, 1999. MR1687331 (2000j:68062)
84. [H50] R. Hamming, Error detecting and error correcting codes, Bell System Technical Journal, 29:147-160, 1950. MR0035935 (12:35c)
85. [HMP06] S. Hoory, A. Magen, and T. Pitassi. Monotone circuits for the majority function. 10th International Workshop on Randomization and Computation (RANDOM), 2006.
86. [Hoo02] S. Hoory. On graphs of high girth. PhD thesis, Hebrew University of Jerusalem, 2002.
87. [Hoo05] S. Hoory. A lower bound on the spectral radius of the universal cover of a graph. J. Combin. Theory Ser. B, 93(1):33-43, 2005. MR2102266 (2005k:05144)
88. [IM04] P. Indyk and J. Matoušek. Low-distortion embeddings of finite metric spaces. In Jacob E. Goodman and Joseph O'Rourke, editors, Handbook of discrete and computational geometry, Discrete Mathematics and Its Applications (Boca Raton), pages 177-196. Chapman & Hall/CRC, Boca Raton, FL, second edition, 2004.
89. [INW94] R. Impagliazzo, N. Nisan, and A. Wigderson. Pseudorandomness for network algorithms. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pages 356-364, 1994.
90. [Jer03] M. Jerrum. Counting, sampling and integrating: algorithms and complexity. Lectures in Mathematics ETH Zürich. Birkhäuser Verlag, Basel, 2003. MR1960003 (2004a:68044)
91. [JL84] W. B. Johnson and J. Lindenstrauss. Extensions of Lipschitz mappings into a Hilbert space. In Conference in modern analysis and probability (New Haven, CT, 1982), volume 26 of Contemp. Math., pages 189-206. Amer. Math. Soc., Providence, RI, 1984. MR0737400 (86a:46018)
92. [JŁR00] S. Janson, T. Luczak, and A. Rucinski. Random graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience, New York, 2000. MR1782847 (2001k:05180)
93. [JM87] S. Jimbo and A. Maruoka. Expanders obtained from affine transformations. Combinatorica, 7(4):343-355, 1987. MR0931192 (89d:68071)
94. [JS89] M. Jerrum and A. Sinclair. Approximate counting, uniform generation and rapidly mixing Markov chains. Inform. and Comput., 82(1):93-133, 1989. MR1003059 (91g:68084)
95. [JS96] M. Jerrum and A. Sinclair. The Markov chain Monte Carlo method: an approach to approximate counting and integration. In D. S. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, Boston, MA, 1996.
96. [JSV04] M. Jerrum. A. Sinclair, and E. Vigoda. A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. J. ACM, 51(4):671-697 (electronic), 2004. MR2147852 (2006b:15013)
97. [Kah95] N. Kahale. Eigenvalues and expansion of regular graphs. J. Assoc. Comput. Mach., 42(5):1091-1106, 1995. MR1412045 (97f:68149)
98. [Kar72] R. M. Karp. Reducibility among combinatorial problems. In Complexity of computer computations (Proc. Sympos., IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, 1972), pages 85-103. Plenum, New York, 1972. MR0378476 (51:14644)
99. n(Z). International Journal of Algebra and Computation, 15(5-6), 971-995, 2005. MR2197816
100. [Kas05b] M. Kassabov. Symmetric groups and expander graphs, http://www.arxiv.org/abs/math.GR/0505624, 2005.
101. [Kaz67] D. A. Kazhdan. On a connection between the dual space of a group and the structure of its closed subgroups. Func. Anal. Appl, 1:63-65, 1967.
102. [KKL88] J. Kahn, G. Kalai, and N. Linial. The influence of variables on boolean functions. In 29th IEEE Symposium on Foundations of Computer Science (White Planes), pages 68-80. IEEE Computer Society, 1988.
103. [KLN05] M. Kassabov, A. Lubotzky, and N. Nikolov. Finite simple groups as expanders. http://wwu.arxiv.org/abs/matb.GR/0510562, 2005.
104. [Kör89] T. W. Körner. Fourier analysis. Cambridge University Press, Cambridge, second edition, 1989. MR1035216 (90j:42001)
105. [KPS85] R. Karp, N. Pippenger, and M. Sipser. A time-randomness tradeoff. In AMS Conference on Probabilistic Computational Complexity, 1985.
106. [KV05] S. Khot and N. Vishnoi. The unique games conjecture, integrality gap for cut problems and embeddability of negative type metrics into 11. In The 46th Annual Symposium on Foundations of Computer Science, 2005.
107. [Lin02] N. Linial. Finite metric-spaces-combinatorics, geometry and algorithms. In Proceedings of the International Congress of Mathematicians, Vol. Ill (Beijing, 2002), pages 573-586, Beijing, 2002. Higher Ed. Press. MR1957562 (2003k:05045)
108. [LL06] N. Linial and E. London. On the expansion rate of Margulis expanders. Journal of Combinatorial Theory, Ser. B, 96(3):436-442, 2006. MR2220670
109. [LLR95] N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15(2):215-245, 1995. MR1337355 (96e:05158)
110. [LM00] N. Linial and A. Magen. Least-distortion Euclidean embeddings of graphs: products of cycles and expanders. J. Combin. Theory Ser. B, 79(2):157-171, 2000. MR1769197 (2002c:05062)
111. [LMN02] N. Linial, A. Magen, and A. Naor. Girth and Euclidean distortion. Geom. Funct. Anal., 12(2):380-394, 2002. MR1911665 (2003d:05054)
112. [LMSS01] M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman. Improved low-density parity-check codes using irregular graphs. IEEE Trans. Inform. Theory, 47(2):585-598, 2001. MR1820478 (2002h:94115)
113. [LN98] A. Lubotzky and T. Nagnibeda. Not every uniform tree covers Ramanujan graphs. J. Combin. Theory Ser. B, 74(2):202-212, 1998. MR1654133 (2000g:05052)
114. 1. Geom. Funct. Anal., 14(4):745-747, 2004. MR2084978 (2005g:46035)
115. [Lok01] S. V. Lokam. Spectral methods for matrix rigidity with applications to size-depth trade-offs and communication complexity. J. Comput. System Sci., 63(3):449-473, 2001. MR1892859 (2003a:68059)
116. [Lov93] L. Lovász. Combinatorial problems and exercises. North-Holland Publishing Co., Amsterdam, second edition, 1993. MR1265492 (94m:05001)
117. [LPS88] A. Lubotzky, R. Phillips, and P. Sarnak. Ramanujan graphs. Combinatorial, 8(3):261-277, 1988. MR0963118 (89m:05099)
118. [LR99] T. Leighton and S. Rao. Multicommodity max-flow rain-cut theorems and their use in designing approximation algorithms. J. ACM, 46(6):787-832, 1999. MR1753034 (2001e:05125)
119. [LR05] N. Linial and E. Rozenman. Random lifts of graphs: perfect matchings. Combinatorial, 25(4):407-424, 2005. MR2143247 (2006c:05110)
120. d. European J. Combin., 26(6):965-993, 2005. MR2143204 (2006g:20043)
121. [Lub] A. Lubotzky. Finite simple groups of lie type as expanders. In preparation.
122. [Lub94] A. Lubotzky. Discrete groups, expanding graphs and invariant measures, volume 125 of Progress in Mathematics. Birkhäuser Verlag, Basel, 1994. With an appendix by Jonathan D. Rogawski. MR1308046 (96g:22018)
123. [LW93] A. Lubotzky and B. Weiss. Groups and expanders. In Expanding graphs (Princeton, NJ, 1992), volume 10 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci., pages 95-109. Amer. Math. Soc., Providence, RI, 1993. MR1235570 (95b:05097)
124. [LW98] L. Lovász and P. Winkler. Mixing times. In Microsurveys in discrete probability (Princeton, NJ, 1997), volume 41 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci., pages 85-133. Amer. Math. Soc., Providence, RI, 1998. MR1630411 (99h:60138)
125. [LZ] A. Lubotzky and A. Zuk. On property (t). In preparation.
126. [Mar73] G. A. Margulis. Explicit constructions of expanders. Problemy Peredači Informacii, 9(4):71-80, 1973. MR0484767 (58:4643)
127. [Mar82] G. A. Margulis. Explicit constructions of graphs without short cycles and low density codes. Combinatorica, 2(1):71-78, 1982. MR0671147 (83j:05053)
128. [Mar88] G. A. Margulis. Explicit group-theoretic constructions of combinatorial schemes and their applications in the construction of expanders and concentrators. Problems of Information Transmission, 24(1):39-46, 1988. MR0939574 (89f:68054)
129. [Mat02] J. Matousek. Lectures on discrete geometry, volume 212 of Graduate Texts in Mathematics. Springer-Verlag, New York, 2002. MR1899299 (2003f:52011)
130. [McK81] B. D. McKay. The expected eigenvalue distribution of a large regular graph. Linear Algebra Appl., 40:203-216, 1981. MR0629617 (84h:05089)
131. [Mor94] M. Morgenstern. Existence and explicit constructions of q + 1 regular Ramanujan graphs for every prime power q. J. Combin. Theory Ser. B, 62(1):44-62, 1994. MR1290630 (95h:05089)
132. [MR95] R. Motwani and P. Raghavan. Randomized algorithms. Cambridge University Press, Cambridge, 1995. MR1344451 (96i:65003)
133. [MR00] R. A. Martin and D. Randall. Sampling adsorbing staircase walks using a new Markov chain decomposition method. In 41st Annual Symposium on Foundations of Computer Science (Redondo Beach, CA, 2000), pages 492-502. IEEE Comput. Soc. Press, Los Alamitos, CA, 2000. MR1931846
134. [MRRW77] R. J. McEliece, E. R. Rodemich, H. Rumsey, Jr., and L. R. Welch. New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities. IEEE Trans. Information Theory, IT-23(2):157-166, 1977. MR0439403 (55:12296)
135. [MS77a] F. J. MacWilliams and N. J. A. Sloane. The theory of error-correcting codes. I. North-Holland Publishing Co., Amsterdam, 1977. North-Holland Mathematical Library, Vol. 16. MR0465509 (57:5408a)
136. [MS77b] F. J. MacWilliams and N. J. A. Sloane. The theory of error-correcting codes. II. North-Holland Publishing Co., Amsterdam, 1977. North-Holland Mathematical Library, Vol. 16. MR0465510 (57:5408b)
137. [MS86] V. D. Milman and G. Schechtman. Asymptotic theory of finite-dimensional normed spaces, volume 1200 of Lecture Notes in Mathematics. Springer-Verlag, Berlin, 1986. With an appendix by M. Gromov. MR0856576 (87m:46038)
138. [MT] R. Montenegro and P. Tetali. A primer on modern techniques for bounding mixing times. Preprint at http://www.math.gatech.edu/Etetali/RESEARCH/ pubs.html.
139. [MW02] R. Meshulam and A. Wigderson. Expanders from symmetric codes. In Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing, pages 669-677, 2002. MR2121194
140. [Nik05] N. Nikolov. A product decomposition for the classical quasisimple groups, http://www.arxiv.org/abs/math.GR/0510173, 2005.
141. [Nil91] A. Nilli. On the second eigenvalue of a graph. Discrete Math., 91(2):207-210, 1991. MR1124768 (92j:05124)
142. [N1104] A. Nilli, Tight estimates for eigenvalues of regular graphs. Electron. J. Combin., 11:N9, 4 pp. (electronic), 2004. MR2056091
143. [Nov02] T. Novikoff. Asymptotic behavior of the random 3-regular bipartite graph. Preprint. 2002.
144. [NZ96] Noam Nisan and David Zuckerman. Randomness is linear in space. J. Comput. System Sci., 52(1):43-52, 1996. MR1375803 (97c:68050)
145. [Pap94] C. H. Papadimitriou. Computational complexity. Addison-Wesley Publishing Company, Reading, MA. 1994. MR1251285 (95f:68082)
146. [Pin73] M. S. Pinsker. On the complexity of a concentrator. In 7th International Telegraffic Conference, pages 318/1-318/4, 1973.
147. [PU89] D. Peleg and E. Upfal. Constructing disjoint paths on expander graphs. Combinatorica, 9(3):289-313, 1989. MR1030383 (91h:05115)
148. [Rab80] M. O. Rabin. Probabilistic algorithm for testing primality. J. Number Theory, 12(1):128-138, 1980. MR0566880 (81f:10003)
149. [Rei05] O. Reingold. Undirected st-connectivity in log-space. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pages 376-385, 2005. MR2181639 (2006g:68118)
150. [Roi96] Y. Roichman. Upper bound on the characters of the symmetric groups. Invent. Math., 125(3):451-485, 1996. MR1400314 (97e:20014)
151. [RS03] R. Raz and A. Shpilka. Lower bounds for matrix product in bounded depth circuits with arbitrary gates. SIAM J. Comput., 32(2):488-513 (electronic), 2003. MR1969401 (2004d:68052)
152. [RSU01] T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke. Design of capacity-approaching irregular low-density parity-check codes. IEEE Trans. Inform. Theory, 47(2):619-637, 2001. MR1820480 (2002d:94068)
153. [RSW04] E. Rozenman, A. Shalev, and A. Wigderson. A new family of Cayley expanders (?). In Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pages 445-454, 2004. MR2121630 (2005j:68120)
154. [RTV05] O. Reingold, L. Trevisan, and S. Vadhan. Pseudorandom walks in biregular graphs and the RL vs. L problem. Technical Report TR05-022, Electronic Colloquium on Computational Complexity (ECCC), 2005. http://uww.eccc.uni-trier. de/eccc/.
155. [RU] T. Richardson and R. Urbanke. Modern coding theory. Draft of the book, http://lthcwww.epfl.ch/mct/index.php.
156. [RU01] T. J. Richardson and R. L. Urbanke. The capacity of low-density parity-check codes under message-passing decoding. IEEE Trans. Inform. Theory, 47(2):599-618, 2001. MR1820479 (2002c:94048)
157. [Rud91] W. Rudin. Functional analysis. International Series in Pure and Applied Mathematics. McGraw-Hill Inc., New York, second edition, 1991. MR1157815 (92k:46001)
158. [RV05] E. Rozenman and S. Vadhan. Derandomized squaring of graphs. In Proceedings of the 8th International Workshop on Randomization and Computation (RANDOM), volume 3624 of Lecture Notes in Computer Science, pages 436-447, 2005. MR2193707
159. [RVW02] 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. MR1888797 (2003c:05145)
160. [Sar04] P. Sarnak. What is... an expander? Notices Amer. Math. Soc., 51(7):762-763, 2004. MR2072849
161. [Ser77] J.-P. Serre. Linear representations of finite groups. Springer-Verlag, New York, 1977.
162. Translated from the second French edition by Leonard L. Scott, Graduate Texts in Mathematics, Vol. 42. MR0450380 (56:8675)
163. [Sha48] C. E. Shannon. A mathematical theory of communication. Bell System Tech. J., 27:379-423, 623-656, 1948. MR0026286 (10:133e)
164. [Sha99] Y. Shalom. Bounded generation and Kazhdan's property (T). Inst. Hautes Études Sci. Publ. Math., 90:145-168 (2001), 1999. MR1813225 (2001m:22030)
165. [Sha04] R. Shaltiel. Recent developments in extractors. In G. Paun, G. Rozenberg, and A. Salomaa, editors, Current trends in theoretical computer science, volume 1: Algorithms and Complexity. World Scientific Publishing Co., 2004. MR2193911
166. [Sie] A. Siegel. A historical review of the isoperimetric theorem in 2-d, and its place in elementary plane geometry. http://www.cs.nyu.edu/faculty/ siegel/SCIAM.pdf.
167. [Sim03] M. Simonovits. How to compute the volume in high dimension? Math. Program., 97(1-2, Ser. B):337-374, 2003. ISMP, 2003 (Copenhagen). MR2004402 (2004j:68194)
168. [Sip97] M. Sipser. Introduction to the Theory of Computation. PWS Publishing Company, 1997.
169. [Spi96] D. A. Spielman. Linear-time encodable and decodable error-correcting codes. IEEE Trans. Inform. Theory, 42(6, part 1):1723-1731, 1996. Codes and complexity. MR1465732 (98g:94034)
170. [SS77] R. Solovay and V. Strassen. A fast Monte-Carlo test for primality. SIAM J. Comput., 6(1):84-85, 1977. MR0429721 (55:2732)
171. [SS96] M. Sipser and D. A. Spielman. Expander codes. IEEE Trans. Inform. Theory, 42(6, part 1):1710-1722, 1996. Codes and complexity. MR1465731 (98d:94031)
172. [ST] H. Stark and A. Terras. Zeta functions of finite graphs and coverings, part iii. Advances in Mathematics, to appear.
173. [Sud00] M. Sudan. A crash course on coding theory, http://theory.lcs.mit. edu/~madhu/coding/ibm/, 2000.
174. [Sud04] M. Sudan. Probabilistically checkable proofs. In Computational complexity theory, volume 10 of IAS/Park City Math. Ser., pages 349-389. Amer. Math. Soc., Providence, RI, 2004. MR2089735
175. [Tan81] R. M. Tanner. A recursive approach to low complexity codes. IEEE Trans. Inform. Theory, 27(5):533-547, 1981. MR0650686 (83i:94017)
176. [Tan84] R. M. Tanner. Explicit concentrators from generalized Argons. SIAM J. Algebraic Discrete Methods, 5(3):287-293, 1984. MR0752035 (85k:68080)
177. [Tho03] J. Thorpe. Low-Density Parity-Check codes constructed from protographs. In The Interplanetary Network Progress Report 43-154, Jet Propulsion Laboratory, Pasadena, CA, pages 1-7, 2003.
178. [TW96] C. A. Tracy and H. Widom. On orthogonal and symplectic matrix ensembles. Comm. Math. Phys., 177(3):727-754, 1996. MR1385083 (97a:82055)
179. [UW87] E. Upfal and A. Wigderson. How to share memory in a distributed system. J. Assoc. Comput. Mach., 34(1):116-127, 1987. MR0882664 (88c:68009)
180. [Val76] L. G. Valiant. Graph-theoretic properties in computational complexity. J. Comput. System Sci., 13(3):278-285, 1976.
181. Working papers presented at the ACM-SIGACT Symposium on the Theory of Computing (Albuquerque, NM, 1975). MR0441008 (55:13874)
182. [Val03] A. Valette. On the Baum-Connes assembly map for discrete groups. In Proper group actions and the Baum-Connes conjecture, Adv. Courses Math. CRM Barcelona, pages 79-124. Birkhäuser, Basel, 2003. With an appendix by Dan Kucerovsky. MR2027170 (2005d:19008)
183. [vL99] J. H. van Lint. Introduction to coding theory, volume 86 of Graduate Texts in Mathematics. Springer-Verlag, Berlin, third edition, 1999. MR1664228 (2000a:94001)
184. [vLW01] J. H. van Lint and R. M. Wilson. A course in combinatorics. Cambridge University Press, Cambridge, second edition, 2001. MR1871828 (20021:05001)
185. [Vu05] V. H. Vu. Spectral norm of random matrices. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pages 423-430, 2005. MR2181644 (Review)
186. [Wig58] E. P. Wigner. On the distribution of the roots of certain symmetric matrices. Ann. of Math. (2), 67:325-327, 1958. MR0095527 (20:2029)
187. [Wig06] A. Wigderson. P, NP and mathematics - a computational complexity perspective. In Proc. of the 2006 International Congress of Mathematicians. Madrid, August 2006. Preprint at http://www.math.ias.edu/~avi/PUBLICATIONS/ MYPAPERS/W06/W06.pdf.
188. [Wor99] N. C. Wormald. Models of random regular graphs. In Surveys in combinatorics, 1999 (Canterbury), volume 267 of London Math. Soc. Lecture Note Ser., pages 239-298. Cambridge Univ. Press, Cambridge, 1999. Corrections and addenda at http://www.math.uwaterloo.ca/~nwonnald/papers/regcorrs. MR1725006 (2000j:05114)
189. [WZ93] A, Wigderson and D. Zuckerman, Expanders that beat the eigenvalue bound: explicit contruction and applications, Combinatorial, 19(1):125-138, 1999. MR1722214 (2000j:05081)
190. [Zuc05] D. Zuckerman. Linear degree extractors and inapproximability of MAX-CLIQUE and chromatic number. Manuscript, 2005.