Essentially every unimodular matrix defines an expander

Theory of Computing Systems

Volumn 36, Issue 2, 2003, Pages 105-135

  Cai, Jin Yi ^a,b  

^a the State University of New York   (United States)

^b University of Wisconsin Madison   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

UNIMODULAR MATRIX;

INTEGRAL EQUATIONS; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; THEOREM PROVING;

MATRIX ALGEBRA;

EID: 0038269061     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-002-1017-y     Document Type: Article

References (38)

1. M. Ajtai. Recursive construction for Γ-regular expanders. Combinatorica, 14(4):379-416, 1994.
2. M. Ajtai, J. Komlos and E. Szemeredi. Sorting in clog n parallel steps. Combinatorica, 3:1-19, 1983.
3. M. Ajtai, J. Komlos and E. Szemeredi. Deterministic simulation in LOGSPACE. Proc. 19th ACM STOC, pp. 132-140, 1987.
4. M. Ajtai, J. Komlós and E. Sremerédi. Generating expanders from two permutations. In A Tribute to Paul Erdös, edited by A. Baker, B. Bollobás and A. Hajnal, pp. 1-12. Cambridge University Press, Cambridge, 1990.
5. N. Alon. Eigenvalues, geometric expanders, sorting in rounds and Ramsey Theory. Combinatorica, 6:207-219, 1986.
6. N. Alon. Eigenvalues and expanders. Combinatorica, 6(2):83-96, 1986.
7. N. Alon and V. D. Milman. Eigenvalues, expanders and superconcentrators. Proc. 25th ACM STOC, pp. 320-322, 1984.
8. N. Alon and V. D. Milman. Ω isoperimetric inequalities for graphs, and superconcentrators. J. Combin. Theory Ser. B, 38(1):73-88, 1985.
9. N. Alon, Z. Galil and V. D. Milman. Better expanders and superconcentrators. J. Algorithms, 8(3): 337-347, 1987.
10. N. Alon, O. Goldreich, J. Hasted and R. Peralta. Simple construction of almost k-wise independent random variables. Proc. 31st FOCS, pp. 544-553, 1990.
11. N. Alon and J. Spencer, with an appendix by P. Erdös. The Probabilistic Method. Wiley, New York, 1992.
12. D. Angulin. A note on a construction of Margulis. Inform. Process. Lett., 8:17-19, 1979.
13. M. Blum. Independent unbiased coin flips from a correlated biased source - a finite state Markov chain. Combinatorica, 6(2):97-108, 1986.
14. 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(3):164-167, 1981.
15. A. Broder and E. Shamir. On the second eigenvalue of random regular graphs. Proc. 28th FOCS, pp. 286-294, 1987.
16. B. Chor and O. Goldreich. Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Comput., 17(2):230-261, 1988.
17. F. R. K. Chung. On concentrators, superconcentrators, generalized, and non-blocking networks. Bell Systems Tech. J., 58:1765-1777, 1978.
18. A. Cohen and A. Wigderson. Dispersers, deterministic amplification, and weak random sources. Proc. 30th FOCS, pp. 14-19, 1989.
19. J. Friedman. On the second eigenvalue and random walks in random regular graphs. Combinatorica, 11(4):331-362, 1991.
20. J. Friedman, J. Kahn and E. Szemer'edi. On the second eigenvalue in random regular graphs. Proc. 21st ACM STOC, pp. 587-598, 1989.
21. O. Gabber and Z. Galil. Explicit construction of linear size superconcentrators. J. Comput. System Sci., 22:407-420, 1981.
22. O. Goldreich, R. Impagliazzo, L. Levin, R. Venkatesan and D. Zuckerman. Security preserving amplification of hardness. Proc. 31rt FOCS, pp. 318-326, 1990.
23. O. Goldreich and A. Wigderson. Tiny families of functions with random properties: a quality-size trade-off for hashing. Random Structures Algorithms, 11(4):315-343, 1997.
24. J. Hastad, R. Impagliazzo, L. Levin and M. Luby. A pseudorandom generator from any one-way function. SIAM J. Comput., 28(4):1364-1396, 1999.
25. R. Impagliazzo, N. Nisan and A. Wigderson. Pseudorandomness for network algorithms. Proc. 26th ACM STOC, pp. 356-364, 1994.
26. R. Impagliazzo, R. Shaltiel and A. Wigderson. Extractors and pseudo-random generators with optimal seed length. Proc. 32nd ACM STOC, pp. 1-10, 2000.
27. R. Impagliazzo and D. Zuckerman. How to recycle random bits. Proc. 30th FOCS, pp. 248-253, 1989.
28. S. Jimbo and A. Maruoka. Expanders obtained from affine transformations. Combinatorica, 7(4): 343-355, 1987.
29. A. Lubotsky, R. Phillip and P. Sarnak. Explicit expanders and the Ramanujan conjectures. Proc. 18th ACM STOC, pp. 240-246, 1986. Combinatorica, 8:261-277, 1988.
30. A. Lubotsky, R. Phillip and P. Sarnak. Explicit expanders and the Ramanujan conjectures. Proc. 18th ACM STOC, pp. 240-246, 1986. Combinatorica, 8:261-277, 1988.
31. G. A. Margulis. Explicit construction of concentrators. Problems Inform. Transmission, 9:325-332, 1973.
32. G. A. Margulis. Explicit group-theoretic constructions for combinatorial designs with applications expanders and concentrators. Problems Inform. Transmission, 24:39-46, 1988.
33. J. Naor and M. Naor. Small bias probability spaces: efficient constructions and applications. Proc. 22nd ACM STOC, pp. 213-223, 1990.
34. N. Pippenger. Superconcentrators. SIAM J. Comput., 6:298-304, 1972.
35. M. Pinsker. On the complexity of a concentrator. Proc. 7th International Teletraffic Conference, Stock-holm, pp. 318/1-318/4, 1973.
36. O. Reingold, S. Vadhan and A. Wigderson. Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors. Proc. 41st IEEE FOCS, pp. 3-13, 2000.
37. M. Tanner. Explicit concentrators from generalized n-gons. SIAM J. Algebraic Discrete Methods, 5(3):287-293, 1984.
38. L. Valiant. Graph-theoretic properties in computational complexity. J. Comput. System Sci., 13:278-285, 1976.