Venkatesan Guruswami
Christopher Umans
Skip Abstract Section
Abstract
We give an improved explicit construction of highly unbalanced bipartite expander graphs with expansion arbitrarily close to the degree (which is polylogarithmic in the number of vertices). Both the degree and the number of right-hand vertices are polynomially close to optimal, whereas the previous constructions of Ta-Shma et al. [2007] required at least one of these to be quasipolynomial in the optimal. Our expanders have a short and self-contained description and analysis, based on the ideas underlying the recent list-decodable error-correcting codes of Parvaresh and Vardy [2005].
Our expanders can be interpreted as near-optimal “randomness condensers,” that reduce the task of extracting randomness from sources of arbitrary min-entropy rate to extracting randomness from sources of min-entropy rate arbitrarily close to 1, which is a much easier task. Using this connection, we obtain a new, self-contained construction of randomness extractors that is optimal up to constant factors, while being much simpler than the previous construction of Lu et al. [2003] and improving upon it when the error parameter is small (e.g., 1/poly(n)).
- ]]Armoni, R. 1998. On the derandomization of space-bounded computations. In RANDOM, M. Luby, J. D. P. Rolim, and M. J. Serna, Eds. Lecture Notes in Computer Science, vol. 1518. Springer-Verlag, Berlin, Germany, 47--59. Google Scholar
Digital Library
- ]]Buhrman, H., Miltersen, P. B., Radhakrishnan, J., and Venkatesh, S. 2002. Are bitvectors optimal? SIAM J. Comput. 31, 6, 1723--1744 (electronic). Google ScholarDigital Library
- ]]Capalbo, M., Reingold, O., Vadhan, S., and Wigderson, A. 2002. Randomness conductors and constant-degree expansion beyond the degree/2 barrier. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing. ACM, New York, 659--668. Google ScholarDigital Library
- ]]Chor, B., and Goldreich, O. 1988. Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Computing 17, 2 (Apr.), 230--261. Google ScholarDigital Library
- ]]Cohen, A., and Wigderson, A. 1989. Dispersers, deterministic amplification, and weak random sources (extended abstract). In Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, 14--19. Google ScholarDigital Library
- ]]Gabber, O., and Galil, Z. 1981. Explicit constructions of linear-sized superconcentrators. J. Comput. Syst. Sci. 22, 3 (June), 407--420.Google ScholarCross Ref
- ]]Galvin, D., and Tetali, P. 2006. Slow mixing of Glauber dynamics for the hard-core model on regular bipartite graphs. Rand. Struct. Algor. 28, 4, 427--443. Google ScholarDigital Library
- ]]Gillman, D. 1998. A Chernoff bound for random walks on expander graphs. SIAM J. Comput. 27, 4, 1203--1220 (electronic). Google ScholarDigital Library
- ]]Goldreich, O., and Wigderson, A. 1997. Tiny families of functions with random properties: A quality-size trade-off for hashing. Rand. Struct. Algor. 11, 4, 315--343. Google ScholarDigital Library
- ]]Guruswami, V., Hastad, J., Sudan, M., and Zuckerman, D. 2002. Combinatorial bounds for list decoding. IEEE Trans. Inf. Theory 48, 5, 1021--1035. Google ScholarDigital Library
- ]]Guruswami, V., and Rudra, A. 2008. Explicit codes achieving list decoding capacity: Error-correction with optimal redundancy. IEEE Transactions on Information Theory 54, 1 (Jan.), 135--150. (Preliminary version appeared in STOC 2006.) Google ScholarDigital Library
- ]]Guruswami, V., and Sudan, M. 1999. Improved decoding of Reed-Solomon and Algebraic-Geometry codes. IEEE Trans. Inf. Theory 45, 6, 1757--1767. Google ScholarDigital Library
- ]]Guruswami, V., Umans, C., and Vadhan, S. 2006. Extractors and condensers from univariate polynomials. Tech. Rep. TR06-134, Electronic Colloquium on Computational Complexity. October.Google Scholar
- ]]Guruswami, V., Umans, C., and Vadhan, S. 2007. Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes. In Proceedings of the 22nd Annual IEEE Conference on Computational Complexity (CCC ‘07). IEEE Computer Society Press, Los Alamitos, 96--108. Google ScholarDigital Library
- ]]Hoory, S., Linial, N., and Wigderson, A. 2006. Expander graphs and their applications. Bull. Amer. Math. Soc. (N.S.) 43, 4, 439--561 (electronic).Google ScholarCross Ref
- ]]Impagliazzo, R., Levin, L. A., and Luby, M. 1989. Pseudo-random generation from one-way functions (extended abstracts). In Proceedings of the 21st Annual ACM Symposium on Theory of Computing. ACM, New York, 12--24. Google ScholarDigital Library
- ]]Impagliazzo, R., Shaltiel, R., and Wigderson, A. 2000. Extractors and pseudo-random generators with optimal seed length. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing. ACM, New York, 1--10. Google ScholarDigital Library
- ]]Impagliazzo, R., and Zuckerman, D. 1989. How to recycle random bits. In Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science. 248--253. Google ScholarDigital Library
- ]]Kahale, N. 1995. Eigenvalues and expansion of regular graphs. J. ACM 42, 5 (Sept.), 1091--1106. Google ScholarDigital Library
- ]]Kalyanaraman, S. and Umans, C. 2006. On obtaining pseudo-randomness from error-correcting codes. In FSTTCS, S. Arun-Kumar and N. Garg, Eds. Lecture Notes in Computer Science, vol. 4337. Springer-Verlag, New York, 105--116. Google ScholarDigital Library
- ]]Lidl, R., and Niederreiter, H. 1986. Introduction to Finite Fields and Their applications. Cambridge University Press, Cambridge. Google ScholarDigital Library
- ]]Lu, C.-J., Reingold, O., Vadhan, S., and Wigderson, A. 2003. Extractors: Optimal up to constant factors. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing. ACM, New York, 602--611. Google ScholarDigital Library
- ]]Lubotzky, A., Phillips, R., and Sarnak, P. 1988. Ramanujan graphs. Combinatorica 8, 3, 261--277.Google ScholarCross Ref
- ]]Margulis, G. A. 1973. Explicit constructions of expanders. Probl. Peredači Inf. 9, 4, 71--80.Google Scholar
- ]]Margulis, G. A. 1988. Explicit group-theoretic constructions of combinatorial schemes and their applications in the construction of expanders and concentrators. Probl. Peredachi Inf. 24, 1, 51--60.Google Scholar
- ]]Nelson, J., and Woodruff, D. P. 2008. Revisiting norm estimation in data streams. CoRR abs/0811.3648.Google Scholar
- ]]Nisan, N., and Ta-Shma, A. 1999. Extracting randomness: A survey and new constructions. J. Comput. Syst. Sci. 58, 1 (Feb.), 148--173. Google ScholarDigital Library
- ]]Nisan, N., and Zuckerman, D. 1996. Randomness is linear in space. J. Comput. Syst. Sci. 52, 1, 43--52. Google ScholarDigital Library
- ]]Parvaresh, F., and Vardy, A. 2005. Correcting errors beyond the Guruswami-Sudan radius in polynomial time. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, 285--294. Google ScholarDigital Library
- ]]Radhakrishnan, J., and Ta-Shma, A. 2000. Bounds for dispersers, extractors, and depth-two superconcentrators. SIAM J. Disc. Math. 13, 1, 2--24 (electronic). Google ScholarDigital Library
- ]]Rao, A., and Zuckerman, D. 2008. Extractors for three uneven-length sources. In Proceedings of the 12th Workshop on Approximation, Randomization and Combinatorial Optimization (RANDOM). Springer-Verlag, Berlin, Germany, 557--570. Google ScholarDigital Library
- ]]Raz, R., Reingold, O., and Vadhan, S. 2002. Extracting all the randomness and reducing the error in Trevisan's extractors. J. Comput. Syst. Sci. 65, 1 (Aug.), 97--128. (Special Issue on STOC '99.) Google ScholarDigital Library
- ]]Reingold, O., Shaltiel, R., and Wigderson, A. 2006. Extracting randomness via repeated condensing. SIAM J. Comput. 35, 5, 1185--1209. Google ScholarDigital Library
- ]]Reingold, O., Vadhan, S. P., and Wigderson, A. 2001. Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors. Electron. Colloq. Comput. Complex. (ECCC) 8, 18.Google Scholar
- ]]Shaltiel, R. 2002. Recent developments in explicit constructions of extractors. Bull. European Assoc. Theoret. Comput. Sci. 77, 67--. Columns: Computational Complexity.Google Scholar
- ]]Shaltiel, R., and Umans, C. 2005. Simple extractors for all min-entropies and a new pseudo-random generator. J. ACM 52, 2, 172--216. (Conference version appeared in FOCS 2001.) Google ScholarDigital Library
- ]]Shoup, V. 1990. New algorithms for finding irreducible polynomials over finite fields. Math. Comput. 54, 189, 435--447.Google Scholar
- ]]Srinivasan, A., and Zuckerman, D. 1999. Computing with very weak random sources. SIAM J. Comput. 28, 1433--1459. Google ScholarDigital Library
- ]]Sudan, M. 1997. Decoding of Reed-Solomon codes beyond the error-correction bound. J. Complexity 13, 1, 180--193. Google ScholarDigital Library
- ]]Sudan, M., Trevisan, L., and Vadhan, S. 2001. Pseudo-random generators without the XOR lemma. J. Comput. Syst. Sci. 62, 2, 236--266. Google ScholarDigital Library
- ]]Ta-Shma, A. 2002. Storing information with extractors. Inform. Process. Lett. 83, 5, 267--274. Google ScholarDigital Library
- ]]Ta-Shma, A., and Umans, C. 2006. Better lossless condensers through derandomized curve samplers. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, 177--186. Google ScholarDigital Library
- ]]Ta-Shma, A., Umans, C., and Zuckerman, D. 2007. Lossless condensers, unbalanced expanders, and extractors. Combinatorica 27, 2, 213--240. Google ScholarDigital Library
- ]]Ta-Shma, A., and Zuckerman, D. 2004. Extractor codes. IEEE Trans. Inf. Theory 50, 12, 3015--3025. Google ScholarDigital Library
- ]]Ta-Shma, A., Zuckerman, D., and Safra, S. 2006. Extractors from Reed-Muller codes. J. Comput. Syst. Sci. 72, 5, 786--812. Google ScholarDigital Library
- ]]Trevisan, L. 2001. Extractors and pseudorandom generators. J. ACM 48, 4, 860--879. Google ScholarDigital Library
- ]]Umans, C. 2003. Pseudo-random generators for all hardnesses. J. Comput. Syst. Sci. 67, 2, 419--440. Google ScholarDigital Library
- ]]Wigderson, A., and Zuckerman, D. 1999. Expanders that beat the eigenvalue bound: Explicit construction and applications. Combinatorica 19, 1, 125--138.Google ScholarCross Ref
- ]]Zuckerman, D. 1996. Simulating BPP using a general weak random source. Algorithmica 16, 4-5, 367--391.Google ScholarCross Ref
- ]]Zuckerman, D. 1997. Randomness-optimal oblivious sampling. Random Struct. Algorithms 11, 4, 345--367. Google ScholarDigital Library
- ]]Zuckerman, D. 2006. Linear degree extractors and the inapproximability of max clique and chromatic number. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing. ACM, New York, 681--690. Google ScholarDigital Library
Index Terms
- Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
Recommendations
Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes
CCC '07: Proceedings of the Twenty-Second Annual IEEE Conference on Computational ComplexityWe give an improved explicit construction of highly unbalanced bipartite expander graphs with expansion arbitrarily close to the degree (which is polylogarithmic in the number of vertices). Both the degree and the number of right-hand vertices are ...
Better extractors for better codes?
STOC '04: Proceedings of the thirty-sixth annual ACM symposium on Theory of computingWe present an explicit construction of codes that can be list decoded from a fraction (1-ε) of errors in sub-exponential time and which have rate ε/logO(1)(1/ε). This comes close to the optimal rate of Ω(ε), and is the first sub-exponential complexity ...
Better Condensers and New Extractors from Parvaresh-Vardy Codes
CCC '12: Proceedings of the 2012 IEEE Conference on Computational Complexity (CCC)We give a new construction of condensers based on Parvaresh-Vardy codes [PV]. Our condensers have entropy rate $(1 - \alpha)$ for sub constant $\alpha$ (in contrast to [GUV] which required constant $\alpha$) and suffer only sub linear entropy loss. ...
Comments