Monotone Expanders: Constructions and Applications

The main purpose of this work is to formally define monotone expanders and motivate their study with (known and new) connections to other graphs and to several computational and pseudorandomness problems. In particular we explain how monotone expanders of constant degree lead to: 1. constant-degree dimension expanders in finite fields, resolving a question of Barak,

[1]  Paul C. Kainen,et al.  The book thickness of a graph , 1979, J. Comb. Theory, Ser. B.

[2]  A. Lubotzky,et al.  Dimension expanders , 2008, 0804.0481.

[3]  Avi Wigderson,et al.  Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applications , 2008, Theory Comput..

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

[5]  Zeev Dvir,et al.  Towards Dimension Expanders over Finite Fields , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.

[6]  Robert E. Tarjan,et al.  Applications of a planar separator theorem , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[7]  Jean Bourgain,et al.  On the spectral gap for finitely-generated subgroups of SU(2) , 2007 .

[8]  Maria M. Klawe,et al.  Limitations on Explicit Constructions of Expanding Graphs , 1984, SIAM J. Comput..

[9]  A. Lubotzky,et al.  Finite simple groups as expanders. , 2005, Proceedings of the National Academy of Sciences of the United States of America.

[10]  Nicholas Pippenger,et al.  Advances in Pebbling (Preliminary Version) , 1982, ICALP.

[11]  Benjamin Weiss,et al.  Groups and Expanders , 1992, Expanding Graphs.

[12]  Arnold L. Rosenberg,et al.  Embedding graphs in books: a layout problem with applications to VLSI design , 1985 .

[13]  Peter W. Shor,et al.  On the pagenumber of planar graphs , 1984, STOC '84.

[14]  Noga Alon,et al.  An elementary construction of constant-degree expanders , 2007, SODA '07.

[15]  Leslie G. Valiant,et al.  On Time Versus Space , 1977, JACM.

[16]  Aram Wettroth Harrow,et al.  Quantum expanders from any classical Cayley graph expander , 2007, Quantum Inf. Comput..

[17]  N. Linial,et al.  Expander Graphs and their Applications , 2006 .

[18]  Avi Wigderson,et al.  Derandomizing the AW matrix-valued Chernoff bound using pessimistic estimators and applications , 2006, Electron. Colloquium Comput. Complex..

[19]  Endre Szemerédi,et al.  On nontrivial separators for k-page graphs and simulations by nondeterministic one-tape Turing machines , 1986, STOC '86.

[21]  Robin Thomas,et al.  A separator theorem for graphs with an excluded minor and its applications , 1990, STOC '90.

[22]  E. Szemerédi,et al.  Construction of a thin set with small fourier coefficients , 1990 .

[23]  Endre Szemerédi,et al.  Constructing Small Sets that are Uniform in Arithmetic Progressions , 1993, Combinatorics, Probability and Computing.

[24]  Endre Szemerédi,et al.  On determinism versus non-determinism and related problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[25]  Endre Szemerédi,et al.  On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines , 1989, J. Comput. Syst. Sci..

[26]  Rahul Santhanam.  On separators, segregators and time versus space , 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.

[27]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

[28]  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.

[29]  J. Bourgain.  Expanders and dimensional expansion , 2009 .