skip to main content
10.1145/1132516.1132583acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
Article

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

Published: 21 May 2006 Publication History

Abstract

We revisit the general RL vs. L question, obtaining the following results.
Generalizing Reingold's techniques to directed graphs, we present a deterministic, log-space algorithm that given a regular directed graph G (or, more generally, a digraph with Eulerian connected components) and two vertices s and t, finds a path between s and t if one exists.
If we restrict ourselves to directed graphs that are regular and consistently labelled, then we are able to produce pseudorandom walks for such graphs in logarithmic space (this result already found an independent application).
We prove that if (2) could be generalized to all regular directed graphs (including ones that are not consistently labelled) then L=RL. We do so by exhibiting a new complete promise problem for RL, and showing that such a problem can be solved in deterministic logarithmic space given a log-space pseudorandom walk generator for regular directed graphs.

References

[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 C. Rackoff. Random walks, universal traversal sequences, and the complexity of maze problems. In Proc. 20th FOCS, pp. 218--223, 1979.
[3]
R. Armoni, A. Ta-Shma, A. Wigderson, and S. Zhou. An o(log(n)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]
N. Nisan, E. Szemeredi, and A. Wigderson. Undirected connectivity in o(log1.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. See also full version, ECCC TR05-92.
[24]
M. Saks. Randomization and derandomization in space-bounded computation. In IEEE 11th Annual Conference on Structure in Complexity Theory, 1996.
[25]
M. Saks and S. Zhou. bph space(S)⊆rm dspace(S3/2). J. Computer and System Sci., 58(2):376--403, 1999.
[26]
J. Savitch. Relationship between nondeterministic and deterministic tape complexities. J. Computer and System Sci., 4(2):177--192, 1970.
[27]
A. Sinclair and M. Jerrum. Approximate counting, uniform generation and rapidly mixing Markov chains. Inform. and Comput., 82(1):93--133, 1989.
[28]
D. Sivakumar. Algorithmic derandomization via complexity theory. In Proc. 34th STOC, pp. 619--626, 2002.
[29]
A. Wigderson. The complexity of graph connectivity. In Proc. 17th FOCS, pp. 112--132, 1992.

Cited By

View all
  • (2023)Explicit orthogonal and unitary designs2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS57990.2023.00073(1240-1260)Online publication date: 6-Nov-2023
  • (2023)Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and Shortcutting2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS57990.2023.00072(1224-1239)Online publication date: 6-Nov-2023
  • (2023)Certified Hardness vs. Randomness for Log-Space2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS57990.2023.00061(989-1007)Online publication date: 6-Nov-2023
  • Show More Cited By

Index Terms

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

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    STOC '06: Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing
    May 2006
    786 pages
    ISBN:1595931341
    DOI:10.1145/1132516
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 21 May 2006

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. derandomization
    2. expander graphs
    3. mixing time
    4. space-bounded computation
    5. universal traversal sequence
    6. zig-zag product

    Qualifiers

    • Article

    Conference

    STOC06
    Sponsor:
    STOC06: Symposium on Theory of Computing
    May 21 - 23, 2006
    WA, Seattle, USA

    Acceptance Rates

    Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

    Upcoming Conference

    STOC '25
    57th Annual ACM Symposium on Theory of Computing (STOC 2025)
    June 23 - 27, 2025
    Prague , Czech Republic

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)46
    • Downloads (Last 6 weeks)5
    Reflects downloads up to 14 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2023)Explicit orthogonal and unitary designs2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS57990.2023.00073(1240-1260)Online publication date: 6-Nov-2023
    • (2023)Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and Shortcutting2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS57990.2023.00072(1224-1239)Online publication date: 6-Nov-2023
    • (2023)Certified Hardness vs. Randomness for Log-Space2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS57990.2023.00061(989-1007)Online publication date: 6-Nov-2023
    • (2023)Singular Value Approximation and Sparsifying Random Walks on Directed Graphs2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS57990.2023.00054(846-854)Online publication date: 6-Nov-2023
    • (2022)Hitting sets for regular branching programsProceedings of the 37th Computational Complexity Conference10.4230/LIPIcs.CCC.2022.3(1-22)Online publication date: 20-Jul-2022
    • (2022)Equivalence classes and conditional hardness in massively parallel computationsDistributed Computing10.1007/s00446-021-00418-2Online publication date: 20-Jan-2022
    • (2021)Pseudodistributions that beat all pseudorandom generators (extended abstract)Proceedings of the 36th Computational Complexity Conference10.4230/LIPIcs.CCC.2021.33Online publication date: 20-Jul-2021
    • (2020)High-precision Estimation of Random Walks in Small Space2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS46700.2020.00123(1295-1306)Online publication date: Nov-2020
    • (2019)Reproducibility and pseudo-determinism in log-spaceProceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3310435.3310473(606-620)Online publication date: 6-Jan-2019
    • (2019)Space Complexity of Reachability Testing in Labelled GraphsJournal of Computer and System Sciences10.1016/j.jcss.2019.04.002Online publication date: May-2019
    • Show More Cited By

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media