Abstract
A map \({f : \{0,1\}^{n} \to \{0,1\}^{n}}\) has locality t if every output bit of f depends only on t input bits. Arora et al. (Colloquium on automata, languages and programming, ICALP, 2009) asked if there exist bounded-degree expander graphs on 2n nodes such that the neighbors of a node \({x\in\{0,1\}^{n}}\) can be computed by maps of constant locality. We give an explicit construction of such graphs with locality one. We then give three applications of this construction: (1) lossless expanders with constant locality, (2) more efficient error reduction for randomized algorithms, and (3) more efficient hardness amplification of one-way permutations. We also give, for n of the form \({n=4\cdot3^{t}}\), an explicit construction of bipartite Ramanujan graphs of degree 3 with 2n−1 nodes in each side such that the neighbors of a node \({x\in \{0,1\}^{n}{\setminus} \{0^{n}\}}\) can be computed either (1) in constant locality or (2) in constant time using standard operations on words of length \({\Omega(n)}\). Our results use in black-box fashion deep explicit constructions of Cayley expander graphs, by Kassabov (Invent Math 170(2):327–354, 2007) for the symmetric group \({S_{n}}\) and by Morgenstern (J Comb Theory Ser B 62(1):44–62, 1994) for the special linear group SL\({(2,F_{2^{n}})}\).
Similar content being viewed by others
References
Noga Alon & Michael R. Capalbo (2002). Explicit Unique-Neighbor Expanders. In IEEE Symp. on Foundations of Computer Science (FOCS), 73–79.
Noga Alon, Alexander Lubotzky & Avi Wigderson (2001). Semi-Direct Product in Groups and Zigzag Product in Graphs: Connections and Applications. In IEEE Symp. on Foundations of Computer Science (FOCS), 630–637. URL http://dx.doi.org/10.1109/SFCS.2001.959939.
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz (2006) Cryptography in NC0. SIAM J. on Computing 36(4): 845–888
Sanjeev Arora, David Steurer & Avi Wigderson (2009). Towards a Study of Low-Complexity Graphs. In Coll. on Automata, Languages and Programming (ICALP), 119–131.
Ziv Bar-Yossef, Oded Goldreich & Avi Wigderson. (1999). Deterministic Amplification of Space Bounded Probabilistic Algorithms. In IEEE Conf. on Computational Complexity (CCC), 188–198.
Eli Ben-Sasson & Emanuele Viola (2014). Short PCPs with projection queries. In Coll. on Automata, Languages and Programming (ICALP).
Michael R. Capalbo, Omer Reingold, Salil P. Vadhan & Avi Wigderson (2002). Randomness conductors and constant-degree lossless expanders. In ACM Symp. on the Theory of Computing (STOC), 659–668. URL http://doi.acm.org/10.1145/509907.510003.
Aviad Cohen & Avi Wigderson (1989). Dispersers, Deterministic Amplification, and Weak Random Sources. In 30th Symposium on Foundations of Computer Science, 14–19. IEEE, Research Triangle Park, North Carolina.
Mary Cryan & Peter Bro Miltersen (2001). On Pseudorandom Generators in NC 0. In 26th Symposium on Mathematical Foundations of Computer Science (MFCS 01), 272–284. Springer-Verlag.
Scott Diehl, Dieter van Melkebeek (2006) Time-space lower bounds for the polynomial-time hierarchy on randomized machines. SIAM J. on Computing 36(3): 563–594
Ofer Gabber, Zvi Galil (1981) Explicit constructions of linear size superconcentrators. J. of Computer and System Sciences 22: 407–420
Oded Goldreich (2000). Candidate One-Way Functions Based on Expander Graphs. Technical report, Electronic Colloquium on Computational Complexity.
Oded Goldreich (2001). Foundations of Cryptography: Volume 1, Basic Tools. Cambridge University Press, xx+372.
Oded Goldreich, Russell Impagliazzo, Leonid A. Levin, Ramarathnam Venkatesan & David Zuckerman (1990). Security Preserving Amplification of Hardness. In 31st IEEE Symposium on Foundations of Computer Science (FOCS), 318–326.
Dan Gutfreund & Emanuele Viola (2004). Fooling Parity Tests with Parity Gates. In 8thWorkshop on Randomization and Computation (RANDOM), 381–392. Springer.
Alexander Healy & Emanuele Viola (2006). Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two. In 23rd Symp. on Theoretical Aspects of Computer Science (STACS), 672–683. Springer.
Shlomo Hoory, Nathan Linial & Avi Wigderson (2006). Expander graphs and their applications. Bull. Amer. Math. Soc. (N.S.) 43(4), 439–561 (electronic). ISSN 0273-0979. URL http://dx.doi.org/10.1090/S0273-0979-06-01126-8.
Hamid Jahanjou, Eric Miles & Emanuele Viola (2015). Local reductions. In Coll. on Automata, Languages and Programming (ICALP). Available at http://www.ccs.neu.edu/home/viola/.
Jimbo S., Maruoka A. (1987) Expanders obtained from affine transformations. Combinatorica. An Journal of the János Bolyai Mathematical Society 7(4): 343–355
Martin Kassabov (2007). Symmetric groups and expander graphs. Invent. Math. 170(2), 327–354. ISSN 0020-9910. URL http://dx.doi.org/10.1007/s00222-007-0065-y.
J. H. van Lint (1999). Introduction to coding theory. Springer-Verlag, Berlin, 3rd edition, xiv+227.
Lubotzky Alexander, Phillips R., Sarnak P. (1988) Ramanujan graphs. Combinatorica. A Journal of the János Bolyai Mathematical Society 8(3): 261–277
Adam W. Marcus, Daniel A. Spielman & Nikhil Srivastava (2015). Interlacing Families IV: Bipartite Ramanujan Graphs of All Sizes. In IEEE Symp. on Foundations of Computer Science (FOCS), 1358–1377. URL http://dx.doi.org/10.1109/FOCS.2015.87.
Margulis G.A. (1973) Explicit construction of concentrators. Problems Inform. Transmission 9: 325–332
M. Morgenstern (1994). Existence and Explicit Constructions of q + 1 Regular Ramanujan Graphs for Every Prime Power q. Journal of Combinatorial Theory, Series B 62(1), 44–62. ISSN 0095-8956. URL http://www.sciencedirect.com/science/article/pii/S0095895684710549.
Elchanan Mossel, Amir Shpilka, Luca Trevisan (2006) On epsilon-biased generators in NC0. Random Struct. Algorithms 29(1): 56–81
Omer Reingold, Salil Vadhan & Avi Wigderson (2002). Entropy waves, the zigzag graph product, and new constant-degree expanders. Ann. of Math. (2) 155(1), 157–187. ISSN 0003-486X. http://dx.doi.org/10.2307/3062153.
Nicholas Pippenger Richard Karp & Michael Sipser (1985). A time-randomness tradeoff. In AMS Conference on Probabilistic Computational Complexity.
Eyal Rozenman, Aner Shalev & Avi Wigderson (2006). Iterative Construction of Cayley Expander Graphs. Theory of Computing 2(5), 91–120. URL http://dx.doi.org/10.4086/toc.2006.v002a005.
Salil P. Vadhan (2012). Pseudorandomness. Foundations and Trends in Theoretical Computer Science 7(1–3), 1–336. URL http://dx.doi.org/10.1561/0400000010.
Emanuele Viola (2012) The complexity of distributions. SIAM J. on Computing 41(1): 191–218
Ryan Williams (2014). Nonuniform ACC Circuit Lower Bounds. J. of the ACM 61(1), 2:1–2:32. URL http://doi.acm.org/10.1145/2559903.
Andrew Yao (1982). Theory and Applications of Trapdoor Functions. In 23rd IEEE Symp. on Foundations of Computer Science (FOCS), 80–91. IEEE.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Viola, E., Wigderson, A. Local Expanders. comput. complex. 27, 225–244 (2018). https://doi.org/10.1007/s00037-017-0155-1
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00037-017-0155-1