Pseudorandom walks on regular digraphs and the RL vs. L problem

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 2006, Issue , 2006, Pages 457-466

  Reingold, Omer ^a   Trevisan, Luca ^b   Vadhan, Salil ^c  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c HARVARD UNIVERSITY   (United States)

Author keywords

Derandomization; Expander Graphs; Mixing Time; Space Bounded Computation; Universal Traversal Sequence; Zig Zag Product

Indexed keywords

ALGORITHMS; NUMERICAL METHODS; PROBLEM SOLVING; THEOREM PROVING;

DERANDOMIZATION; EXPANDER GRAPHS; MIXING TIME; PSEUDORANDOM WALK GENERATOR; SPACE BOUNDED COMPUTATION; UNIVERSAL TRAVERSAL SEQUENCE; ZIG ZAG PRODUCT;

GRAPH THEORY;

EID: 33748119261     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1132516.1132583     Document Type: Conference Paper

References (30)

1. M. Ajtai, J. Komlós, and E. Szemerédi. Deterministic simulation in LOGSPACE. In Proc. 19th STOC, pp. 132-140, 1987.
2. R. Aleliunas, R. M. Karp, R. J. Lipton, L. Lovász, and G. Rackoff. Random walks, universal traversal sequences, and the complexity of maze problems. In Proc. 20th FOCS, pp. 218-223, 1979.
3. 4/3) space algorithm for (s,t) connectivity in undirected graphs. J. ACM, 47(2):294-311, 2000.
4. L. Babai, N. Nisan, and M. Szegedy. Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs. J. Computer and System Sci., pp. 204-232, 1989.
5. S. Caracciolo, A. Pelissetto, and A. Sokal. Two remarks on simulated tempering. Unpublished manuscript (see [13]), 1992.
6. J. A. Fill. Eigenvalue bounds on convergence to stationarity for nonreversible markov chains with an application to the exclusion process. Ann. Applied Probability, 1:62-87, 1991.
7. I. Haitner, D. Harnik, and O. Reingold. On the power of the randomized iterate. ECCC TR05-135, 2005.
8. A. Healy, S. Vadhan, and E. Viola. Using nondeterminism to amplify hardness. In 36th STOC, pp. 192-201, 2004.
9. P. Indyk. Stable distributions, pseudorandom generators, embeddings and data stream computation. In 41st FOCS, pp. 189-197, 2000.
10. E. Kaplan, M. Naor, and O. Reingold. Derandomized constructions of k-wise (almost) independent permutations. In Proc. 8th RANDOM, Springer LNCS 3624, pp. 354 - 365, 2005.
11. H. R. Lewis and C. H. Papadimitriou. Symmetric space-bounded computation. Theor. Comput. Sci., 19:161-187, 1982.
12. L. Lovász. Combinatorial problems and exercises. North-Holland, Amsterdam, 2nd ed., 1993.
13. N. Madras and D. Randall. Markov chain decomposition for convergence rate analysis. Ann. of Applied Probability, 12:581-606, 2002.
14. R. A. Martin and D. Randall. Sampling adsorbing staircase walks using a new markov chain decomposition method. In Proc. 41st FOCS, pp. 492-502, 2000.
15. M. Mihail. Conductance and convergence of markov chains: a combinatorial treatment of expanders. In Proc. 37th FOCS, pp. 526-531, 1989.
16. Nisan. RL ⊆ SC. In Proc. 24th STOC, pp. 619-623, 1992.
17. N. Nisan. Pseudorandom generators for space-bounded computation. Combinatorica, 12(4):449-461, 1992.
18. 1.5n) space. In Proc. 30th FOCS, pp. 24-29, 1989.
19. N. Nisan and D. Zuckerman. Randomness is linear in space. J. Computer and System Sci., 52(1):43-52, 1996.
20. O. Reingold. Undirected st-connectivity in log-space. In Proc. of the 37th STOC, pages 376-385, 2005.
21. O. Reingold, L. Trevisan, and S. Vadhan. Pseudorandom walks in biregular graphs and the RL vs. L problem. ECCC TR05-022, 2005.
22. O. Reingold, S. Vadhan, and A. Wigderson. Entropy waves, the zig-zag graph product, and new constant-degree expanders. Ann. Mathematics, 155(1), 2001.
23. E. Rozenman and S. Vadhan. Derandomized squaring of graphs. In Proc. 8th RANDOM, Springer LNCS 3624, pp. 436-447, 2005.
24. See also full version, ECCC TR05-92.
25. M. Saks. Randomization and derandomization in space-bounded computation. In IEEE 11th Annual Conference on Structure in Complexity Theory, 1996.
26. 3/2). J. Computer and System Sci., 58(2):376-403, 1999.
27. J. Savitch. Relationship between nondeterministic and deterministic tape complexities. J. Computer and System Sci., 4(2):177-192, 1970.
28. A. Sinclair and M. Jerrum. Approximate counting, uniform generation and rapidly mixing Markov chains. Inform. and Comput., 82(1):93-133, 1989.
29. D. Sivakumar. Algorithmic derandomization via complexity theory. In Proc. 34th STOC, pp. 619-626, 2002.
30. A. Wigderson. The complexity of graph connectivity. In Proc. 17th FOCS, pp. 112-132, 1992.