Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications

n and 0 < δ < 1, we construct graphs on n nodes such that every two sets of size share an edge, having essentially optimal maximum degree . Using known and new reductions from these graphs, we derive new explicit constructions of: 1.  A k round sorting algorithm using comparisons. 2.  A k round selection algorithm using comparisons. 3.  A depth 2 superconcentrator of size . 4.  A depth k wide-sense nonblocking generalized connector of size .All of these results improve on previous constructions by factors of , and are optimal to within factors of . These results are based on an improvement to the extractor construction of Nisan & Zuckerman: our algorithm extracts an asymptotically optimal number of random bits from a defective random source using a small additional number of truly random bits.

[1]  János Komlós,et al.  Almost Sorting in one Round , 1989, Adv. Comput. Res..

[2]  David Zuckerman,et al.  Randomness-optimal oblivious sampling , 1997, Random Struct. Algorithms.

[3]  Noga Alon,et al.  lambda1, Isoperimetric inequalities for graphs, and superconcentrators , 1985, J. Comb. Theory, Ser. B.

[4]  Martin Tompa Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties of Their Circuits , 1980, J. Comput. Syst. Sci..

[5]  Yossi Azar,et al.  Parallel selection , 1990, Discret. Appl. Math..

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

[7]  Nicholas Pippenger,et al.  Superconcentrators of Depth 2 , 1982, J. Comput. Syst. Sci..

[8]  Avi Wigderson,et al.  Superconcentrators, generalizers and generalized connectors with limited depth , 1983, STOC.

[9]  David Zuckerman,et al.  General weak random sources , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[10]  Leslie G. Valiant,et al.  Parallelism in Comparison Problems , 1975, SIAM J. Comput..

[11]  Nicholas Pippenger,et al.  Sorting and Selecting in Rounds , 1987, SIAM J. Comput..

[12]  Roy Meshulam,et al.  A Geometric Construction of a Superconcentrator of Depth 2 , 1984, Theor. Comput. Sci..

[13]  Noam Nisan,et al.  Randomness is Linear in Space , 1996, J. Comput. Syst. Sci..

[14]  Noga Alon,et al.  Sorting, Approximate Sorting, and Searching in Rounds , 1988, SIAM J. Discret. Math..

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

[16]  Moshe Morgenstern Explicit construction of natural bounded concentrators , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[17]  Amnon Ta-Shma,et al.  On Extracting Randomness From Weak Random Sources , 1995, Electron. Colloquium Comput. Complex..

[18]  A. Yao,et al.  Rearrangeable Networks with Limited Depth , 1982 .

[19]  Aravind Srinivasan,et al.  Computing with very weak random sources , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[20]  Paul Feldman,et al.  Wide-Sense Nonblocking Networks , 1988, SIAM J. Discret. Math..

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