Derandomized Squaring of Graphs

We introduce a “derandomized” analogue of graph squaring. This operation increases the connectivity of the graph (as measured by the second eigenvalue) almost as well as squaring the graph does, yet only increases the degree of the graph by a constant factor, instead of squaring the degree. One application of this product is an alternative proof of Reingold's recent breakthrough result that S-T Connectivity in Undirected Graphs can be solved in deterministic logspace.

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

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

[3]  Milena Mihail,et al.  Conductance and convergence of Markov chains-a combinatorial treatment of expanders , 1989, 30th Annual Symposium on Foundations of Computer Science.

[4]  Omer Reingold,et al.  Undirected ST-connectivity in log-space , 2005, STOC '05.

[5]  Dana Randall,et al.  Sampling adsorbing staircase walks using a new Markov chain decomposition method , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

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

[7]  Richard J. Lipton,et al.  Random walks, universal traversal sequences, and the complexity of maze problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[8]  Luca Trevisan,et al.  Pseudorandom Walks in Biregular Graphs and the RL vs. L Problem , 2005, Electron. Colloquium Comput. Complex..

[9]  V. Rich.  Personal communication , 1989, Nature.

[10]  Avi Wigderson,et al.  Universal Traversal Sequences for Expander Graphs , 1993, Inf. Process. Lett..

[11]  Noga Alon,et al.  Bipartite Subgraphs and the Smallest Eigenvalue , 2000, Combinatorics, Probability and Computing.

[12]  Noga Alon,et al.  Derandomized graph products , 1995, computational complexity.

[13]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[14]  Satish Rao,et al.  Expander flows, geometric embeddings and graph partitioning , 2004, STOC '04.