ENTROPY WAVES, THE ZIG-ZAG GRAPH PRODUCT, AND NEW CONSTANT-DEGREE

The main contribution of this work is a new type of graph product, which we call the {\it zig-zag product}. Taking a product of a large graph with a small graph, the resulting graph inherits (roughly) its size from the large one, its degree from the small one, and its expansion properties from both! Iteration yields simple explicit constructions of constant-degree expanders of arbitrary size, starting from one constant-size expander. Crucial to our intuition (and simple analysis) of the properties of this graph product is the view of expanders as functions which act as ``entropy wave" propagators -- they transform probability distributions in which entropy is concentrated in one area to distributions where that concentration is dissipated. In these terms, the graph products affords the constructive interference of two such waves. Subsequent work [ALW01], [MW01] relates the zig-zag product of graphs to the standard semidirect product of groups, leading to new results and constructions on expanding Cayley graphs.

[1]  Avi Wigderson,et al.  Expanders In Group Algebras , 2004, Comb..

[2]  Noga Alon,et al.  Semi-direct product in groups and zig-zag product in graphs: connections and applications , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[3]  Amnon Ta-Shma,et al.  Loss-less condensers, unbalanced expanders, and extractors , 2001, STOC '01.

[4]  Avi Wigderson,et al.  Extracting randomness via repeated condensing , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[5]  Igor Pak,et al.  The product replacement algorithm and Kazhdan’s property (T) , 2000 .

[6]  Ran Raz,et al.  On recycling the randomness of states in space bounded computation , 1999, STOC '99.

[7]  Noam Nisan,et al.  Extracting Randomness: A Survey and New Constructions , 1999, J. Comput. Syst. Sci..

[8]  Avi Wigderson,et al.  P = BPP if E requires exponential circuits: derandomizing the XOR lemma , 1997, STOC '97.

[9]  Noam Nisan,et al.  Extracting randomness: how and why. A survey , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).

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

[11]  Daniel A. Spielman,et al.  Linear-time encodable and decodable error-correcting codes , 1995, STOC '95.

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

[13]  Moshe Morgenstern,et al.  Existence and Explicit Constructions of q + 1 Regular Ramanujan Graphs for Every Prime Power q , 1994, J. Comb. Theory, Ser. B.

[14]  Alexander Lubotzky,et al.  Discrete groups, expanding graphs and invariant measures , 1994, Progress in mathematics.

[15]  Noam Nisan,et al.  Pseudorandomness for network algorithms , 1994, STOC '94.

[16]  Noga Alon,et al.  Random Cayley Graphs and Expanders , 1994, Random Struct. Algorithms.

[17]  Joel Friedman,et al.  On the second eigenvalue and random walks in randomd-regular graphs , 1991, Comb..

[18]  A. Nilli.  On the second eigenvalue of a graph , 1991 .

[19]  Noga Alon,et al.  Simple construction of almost k-wise independent random variables , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[20]  Leonid A. Levin,et al.  Security preserving amplification of hardness , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[21]  Moni Naor,et al.  Small-bias probability spaces: efficient constructions and applications , 1990, STOC '90.

[22]  Endre Szemerédi,et al.  On the second eigenvalue of random regular graphs , 1989, STOC '89.

[23]  Victor Shoup,et al.  New algorithms for finding irreducible polynomials over finite fields , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

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

[25]  Miklós Ajtai,et al.  Recursive construction for 3-regular expanders , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[26]  Andrei Z. Broder,et al.  On the second eigenvalue of random regular graphs , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[27]  Noga Alon,et al.  Better Expanders and Superconcentrators , 1987, J. Algorithms.

[28]  Alasdair Urquhart,et al.  Formal Languages]: Mathematical Logic--mechanical theorem proving , 2022 .

[29]  Michael Sipser,et al.  Expanders, Randomness, or Time versus Space , 1988, J. Comput. Syst. Sci..

[30]  Noga Alon,et al.  Eigenvalues, geometric expanders, sorting in rounds, and ramsey theory , 1986, Comb..

[31]  N. Alon.  Eigenvalues and expanders , 1986, Comb..

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

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

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

[35]  M. Gromov.  Filling Riemannian manifolds , 1983 .

[36]  James W. Roberts,et al.  Uniformly exhaustive submeasures and nearly additive set functions , 1983 .

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

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

[39]  Leslie G. Valiant,et al.  Graph-Theoretic Arguments in Low-Level Complexity , 1977, MFCS.