Derandomized graph products


Berman and Schnitger gave a randomized reduction from approximating MAX-SNP problems within constant factors arbitrarily close to 1 to approximating clique within a factor ofn ε (for some ε). This reduction was further studied by Blum, who gave it the namerandomized graph products. We show that this reduction can be made deterministic (derandomized), using random walks on expander graphs. The main technical contribution of this paper is in proving a lower bound for the probability that all steps of a random walk stay within a specified set of vertices of a graph. (Previous work was mainly concerned with upper bounds for this probability.) This lower bound extends also to the case where different sets of vertices are specified for different time steps of the walk.

This is a preview of subscription content, access via your institution.


  1. [1]

    M. Ajtai, J. Komlós, and E. Szemerédi, Deterministic Simulation in Logspace.Proc. Nineteenth Ann. ACM Symp. Theor. Comput., 1987, 132–140.

  2. [2]

    N. Alon, Eigenvalues and expanders.Combinatorica 6 (1986), 83–96.

    Google Scholar 

  3. [3]

    N. Alon andF. R. K. Chung, Explicit construction of linear sized tolerant networks.Discrete Math. 72 (1988), 15–19.

    Google Scholar 

  4. [4]

    E. Amaldi and V. Kann, The complexity and approximability of finding maximum feasible subsystems of linear relations.Theoret. Comput. Sci., to appear.

  5. [5]

    S. Arora, L. Babai, J. Stern, and Z. Sweedyk, The Hardness of Approximate Optima in Lattices, Codes and Linear Equations.Proc. 34th Ann. IEEE Symp. Found. Comput. Sci., 1993, 724–733. (Final version submitted toJ. Comput. System Sci.)

  6. [6]

    S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof Verification and Hardness of Approximation Problems.Proc. 33rd Ann. IEEE Symp. Found. Comput. Sci., 1992, 14–23.

  7. [7]

    S. Arora and S. Safra, Probabilistic Checking of Proofs; A New Characterization of NP.Proc. 33rd Ann. IEEE Symp. Found. Comput. Sci., 1992, 2–13.

  8. [8]

    M. Bellare, O. Goldreich, and S. Goldwasser, Randomness in Interactive Proofs.Proc. 31st Ann. IEEE Symp. Found. Comput. Sci., 1990, 563–572.

  9. [9]

    P. Berman and M. Furer, Approximating maximum independent set in bounded degree graphs.Proc. 5th ACM-SIAM Symp. on Discrete Algorithms, 1994, 365–371.

  10. [10]

    P. Berman andG. Schnitger, On the Complexity of Approximating the Independent Set Problem.Inform. and Comput. 96 (1992), 77–94.

    Google Scholar 

  11. [11]

    A. Blum. Ph.D. dissertation, MIT.

  12. [12]

    A. Cohen and A. Wigderson, Dispersers, deterministic amplification, and weak random sources.Proc. 30th Ann. IEEE Symp. Found. Comput. Sci., 1989, 14–19.

  13. [13]

    U. Feige, S. Goldwasser, L. Lovász, S. Safra, and M. Szegedy, Approximating Clique is Almost NP-complete.Proc. 32nd Ann. IEEE Symp. Found. Comput. Sci., 1991, 2–12.

  14. [14]

    O. Gabber andZ. Galil, Explicit Constructions of Linear Sized Superconcentrators.J. Comput. System Sci. 22(3) (1981), 407–420.

    Google Scholar 

  15. [15]

    M. Garey andD. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979.

    Google Scholar 

  16. [16]

    M. Halldorsson and J. Radhakrishnan, Greed is good: approximating independent sets in sparse and bounded-degree graphs.Proc. Twenty-sixth Ann. ACM Symp. Theor. Comput., 1994, 439–448.

  17. [17]

    R. Impagliazzo and D. Zuckerman, How to Recycle Random Bits.Proc. 30th Ann. IEEE Symp. Found. Comput. Sci., 1989, 248–253.

  18. [18]

    N. Kahale, Better Expansion for Ramanujan Graphs.Proc. 33rd Ann. IEEE Symp. Found. Comput. Sci., 1992, 398–404.

  19. [19]

    R. M. Karp, Reducibility Among Combinatorial Problems. InComplexity of Computer Computations, ed.R. Miller and J. Thatcher. Plenum Press, 1972, 85–103.

  20. [20]

    N. Linial and U. Vazirani, Graph Products and Chromatic Numbers.Proc. 30th Ann. IEEE Symp. Found. Comput. Sci., 1989, 124–128.

  21. [21]

    A. Lubotsky, R. Phillips andP. Sarnak, Ramanujan Graphs.Combinatorica 8(3) (1988), 261–277.

    Google Scholar 

  22. [22]

    G. A. Margulis, Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and superconcentrators.Problemy Peredachi Informatsii 24 (1988), 51–60 (in Russian). English translation inProblems of Information Transmission 24 (1988), 39–46.

    Google Scholar 

  23. [23]

    M. Marcus andH. Minc,A Survey of Matrix Theory and Matrix Inequalities. Allyn and Bacon, Inc., Boston, 1964.

    Google Scholar 

  24. [24]

    C. Papadimitriou andM. Yannakakis, Optimization, Approximation, and Complexity Classes.J. Comput. System Sci. 43 (1991), 425–440.

    Google Scholar 

  25. [25]

    D. Zuckerman, Simulating BPP Using a General Weak Random Source.Proc. 32nd Ann. IEEE Symp. Found. Comput. Sci. 1991, 79–89.

Download references

Author information



Rights and permissions

Reprints and Permissions

About this article

Cite this article

Alon, N., Feige, U., Wigderson, A. et al. Derandomized graph products. Comput Complexity 5, 60–75 (1995).

Download citation

Key words

  • Approximation
  • derandomization
  • random walks

Subject classifications

  • 60J15
  • 68R10