Document Open Access Logo

Derandomized Squaring: An Analytical Insight into Its True Behavior

Authors Gil Cohen , Itay Cohen , Gal Maor , Yuval Peled

PDF
Thumbnail PDF

File

LIPIcs.ITCS.2025.40.pdf
  • Filesize: 0.95 MB
  • 24 pages

Document Identifiers

Author Details

Gil Cohen
  • Tel Aviv University, Israel
Itay Cohen
  • Tel Aviv University, Israel
Gal Maor
  • Tel Aviv University, Israel
Yuval Peled
  • The Hebrew University of Jerusalem, Israel

Funding

  • Cohen, Gil: Supported by ERC starting grant 949499 and by the Israel Science Foundation grant 1569/18.
  • Cohen, Itay: Supported by ERC starting grant 949499 and by the Israel Science Foundation grant 1569/18.
  • Maor, Gal: Supported by ERC starting grant 949499 and by the Israel Science Foundation grant 1569/18.

Cite As Get BibTex

Gil Cohen, Itay Cohen, Gal Maor, and Yuval Peled. Derandomized Squaring: An Analytical Insight into Its True Behavior. In 16th Innovations in Theoretical Computer Science Conference (ITCS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 325, pp. 40:1-40:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ITCS.2025.40

Abstract

The notion of the derandomized square of two graphs, denoted as G s H, was introduced by Rozenman and Vadhan as they rederived Reingold’s Theorem, SL = 𝐋. This pseudorandom primitive, closely related to the Zig-Zag product, plays a crucial role in recent advancements on space-bounded derandomization. For this and other reasons, understanding the spectral expansion λ(G s H) becomes paramount. Rozenman and Vadhan derived an upper bound for λ(G s H) in terms of the spectral expansions of the individual graphs, λ(G) and λ(H). They also proved their bound is optimal if the only information incorporated to the bound is the spectral expansion of the two graphs.
The objective of this work is to gain deeper insights into the behavior of derandomized squaring by taking into account the entire spectrum of H, where we focus on a vertex-transitive c-regular H. Utilizing deep results from analytic combinatorics, we establish a lower bound on λ(G s H) that applies universally to all graphs G. Our work reveals that the bound is the minimum value of the function d⋅ x - d(d-1)χ_x(H)/χ_x'(H) in the domain (c,∞), where χ_x(H) is the characteristic polynomial of the d-vertex graph H. This bound lies far below the known upper bound for λ(G s H) for most reasonable choices for H. Empirical evidence suggests that our lower bound is optimal. We support the tightness of our lower bound by showing that the bound is tight for a class of graphs which exhibit local behavior similar to a derandomized squaring operation with H. To this end, we make use of finite free probability theory.
In our second result, we resolve an open question posed by Cohen and Maor (STOC 2023) and establish a lower bound for the spectral expansion of rotating expanders. These graphs are constructed by taking a random walk with vertex permutations occurring after each step. We prove that Cohen and Maor’s construction is essentially optimal. Unlike our results on derandomized squaring, the proof in this instance relies solely on combinatorial methods. The key insight lies in establishing a connection between random walks on graph products and the Fuss-Catalan numbers.

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Spectra of graphs
Keywords
  • Derandomized Squaring
  • Spectral Graph Theory
  • Analytic Combinatorics

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. AmirMahdi Ahmadinejad, Jonathan Kelner, Jack Murtagh, John Peebles, Aaron Sidford, and Salil Vadhan. High-precision estimation of random walks in small space. In 2020 IEEE 61st Annual Symposium on Foundations of Computer Science, pages 1295-1306. IEEE Computer Soc., Los Alamitos, CA, [2020] (C) 2020. URL: https://doi.org/10.1109/FOCS46700.2020.00123.
  2. AmirMahdi Ahmadinejad, John Peebles, Edward Pyne, Aaron Sidford, and Salil Vadhan. Singular value approximation and reducing directed to undirected graph sparsification. arXiv preprint arXiv:2301.13541, 2023. URL: https://doi.org/10.48550/arXiv.2301.13541.
  3. N. Alon and F. R. K. Chung. Explicit construction of linear sized tolerant networks. In Proceedings of the First Japan Conference on Graph Theory and Applications (Hakone, 1986), volume 72, pages 15-19, 1988. URL: https://doi.org/10.1016/0012-365X(88)90189-6.
  4. Noga Alon. Eigenvalues and expanders. Combinatorica, 6(2):83-96, 1986. URL: https://doi.org/10.1007/BF02579166.
  5. Avraham Ben-Aroya and Amnon Ta-Shma. A combinatorial construction of almost-Ramanujan graphs using the zig-zag product. SIAM J. Comput., 40(2):267-290, 2011. URL: https://doi.org/10.1137/080732651.
  6. Yonatan Bilu and Nathan Linial. Lifts, discrepancy and nearly optimal spectral gap. Combinatorica, 26(5):495-519, 2006. URL: https://doi.org/10.1007/s00493-006-0029-7.
  7. Charles Bordenave. A new proof of Friedman’s second eigenvalue theorem and its extension to random lifts. Ann. Sci. Éc. Norm. Supér. (4), 53(6):1393-1439, 2020. URL: https://doi.org/10.24033/asens.2450.
  8. Charles Bordenave and Benoît Collins. Eigenvalues of random lifts and polynomials of random permutation matrices. Annals of Mathematics, 190(3):811-875, 2019. Google Scholar
  9. Mark Braverman, Gil Cohen, and Sumegha Garg. Pseudorandom pseudo-distributions with near-optimal error for read-once branching programs. SIAM Journal on Computing, 49(5):STOC18-242, 2019. URL: https://doi.org/10.1137/18M1197734.
  10. Eshan Chattopadhyay and Jyun-Jie Liao. Optimal error pseudodistributions for read-once branching programs. In 35th Computational Complexity Conference, volume 169 of LIPIcs. Leibniz Int. Proc. Inform., pages Art. No. 25, 27. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. URL: https://doi.org/10.4230/LIPICS.CCC.2020.25.
  11. Lijie Chen, William Hoza, Xin Lyu, Avishay Tal, and Hongxun Wu. Weighted pseudorandom generators via inverse analysis of random walks and shortcutting. In Electronic Colloquium on Computational Complexity (ECCC), volume 114, 2023. Google Scholar
  12. Gil Cohen and Gal Maor. Random walks on rotating expanders. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing, pages 971-984, 2023. URL: https://doi.org/10.1145/3564246.3585133.
  13. Michael B. Cohen. Ramanujan graphs in polynomial time. In 57th Annual IEEE Symposium on Foundations of Computer Science - FOCS 2016, pages 276-281. IEEE Computer Soc., Los Alamitos, CA, 2016. URL: https://doi.org/10.1109/FOCS.2016.37.
  14. Joel Friedman. A proof of Alon’s second eigenvalue conjecture and related problems. Mem. Amer. Math. Soc., 195(910):viii+100, 2008. URL: https://doi.org/10.1090/memo/0910.
  15. Rostislav I Grigorchuk and Andrzej Zuk. On the asymptotic spectrum of random walks on infinite families of graphs. Random walks and discrete potential theory (Cortona, 1997), pages 188-204, 1999. Google Scholar
  16. Chris Hall, Doron Puder, and William F. Sawin. Ramanujan coverings of graphs. Adv. Math., 323:367-410, 2018. URL: https://doi.org/10.1016/j.aim.2017.10.042.
  17. Shlomo Hoory, Nathan Linial, and Avi Wigderson. Expander graphs and their applications. Bulletin of the American Mathematical Society, 43(4):439-561, 2006. Google Scholar
  18. Yasutaka Ihara. On discrete subgroups of the two by two projective linear group over p-adic fields. J. Math. Soc. Japan, 18:219-235, 1966. URL: https://doi.org/10.2969/jmsj/01830219.
  19. Alexander Lubotzky, Ralph Phillips, and Peter Sarnak. Ramanujan graphs. Combinatorica, 8(3):261-277, 1988. URL: https://doi.org/10.1007/BF02126799.
  20. Adam W. Marcus, Daniel A. Spielman, and Nikhil Srivastava. Interlacing families I: Bipartite Ramanujan graphs of all degrees. Ann. of Math. (2), 182(1):307-325, 2015. URL: https://doi.org/10.4007/annals.2015.182.1.7.
  21. Adam W. Marcus, Daniel A. Spielman, and Nikhil Srivastava. Interlacing families II: Mixed characteristic polynomials and the Kadison-Singer problem. Ann. of Math. (2), 182(1):327-350, 2015. URL: https://doi.org/10.4007/annals.2015.182.1.8.
  22. Adam W Marcus, Daniel A Spielman, and Nikhil Srivastava. Interlacing families IV: Bipartite Ramanujan graphs of all sizes. SIAM Journal on Computing, 47(6):2488-2509, 2018. URL: https://doi.org/10.1137/16M106176X.
  23. Adam W. Marcus, Daniel A. Spielman, and Nikhil Srivastava. Finite free convolutions of polynomials. Probab. Theory Related Fields, 182(3-4):807-848, 2022. URL: https://doi.org/10.1007/s00440-021-01105-w.
  24. Grigorii Aleksandrovich Margulis. Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators. Problemy peredachi informatsii, 24(1):51-60, 1988. Google Scholar
  25. Sidhanth Mohanty and Ryan O'Donnell. X-Ramanujan graphs. In Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, pages 1226-1243. SIAM, Philadelphia, PA, 2020. URL: https://doi.org/10.1137/1.9781611975994.75.
  26. Sidhanth Mohanty, Ryan O'Donnell, and Pedro Paredes. Explicit near-Ramanujan graphs of every degree. SIAM J. Comput., 51(3):1-23, 2022. URL: https://doi.org/10.1137/20M1342112.
  27. Moshe Morgenstern. Existence and explicit constructions of q+1 regular Ramanujan graphs for every prime power q. J. Combin. Theory Ser. B, 62(1):44-62, 1994. URL: https://doi.org/10.1006/jctb.1994.1054.
  28. Jack Murtagh, Omer Reingold, Aaron Sidford, and Salil Vadhan. Derandomization beyond connectivity: undirected Laplacian systems in nearly logarithmic space. SIAM J. Comput., 50(6):1892-1922, 2021. URL: https://doi.org/10.1137/20M134109X.
  29. Alexandru Nica and Roland Speicher. Lectures on the combinatorics of free probability, volume 335 of London Mathematical Society Lecture Note Series. Cambridge University Press, Cambridge, 2006. URL: https://doi.org/10.1017/CBO9780511735127.
  30. A. Nilli. On the second eigenvalue of a graph. Discrete Math., 91(2):207-210, 1991. URL: https://doi.org/10.1016/0012-365X(91)90112-F.
  31. Ryan O'Donnell and Xinyu Wu. Explicit near-fully X-Ramanujan graphs. In 2020 IEEE 61st Annual Symposium on Foundations of Computer Science, pages 1045-1056. IEEE Computer Soc., Los Alamitos, CA, 2020. Google Scholar
  32. Karol A Penson and Karol Życzkowski. Product of ginibre matrices: Fuss-Catalan and Raney distributions. Physical Review E, 83(6):061118, 2011. Google Scholar
  33. Omer Reingold. Undirected connectivity in log-space. J. ACM, 55(4):Art. 17, 24, 2008. URL: https://doi.org/10.1145/1391289.1391291.
  34. Omer Reingold, Salil Vadhan, and Avi Wigderson. Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors. In Proceedings 41st Annual Symposium on Foundations of Computer Science, pages 3-13. IEEE, 2000. URL: https://doi.org/10.1109/SFCS.2000.892006.
  35. Eyal Rozenman and Salil Vadhan. Derandomized squaring of graphs. In Approximation, randomization and combinatorial optimization, volume 3624 of Lecture Notes in Comput. Sci., pages 436-447. Springer, Berlin, 2005. URL: https://doi.org/10.1007/11538462_37.
  36. Amnon Ta-Shma. Explicit, almost optimal, epsilon-balanced codes. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pages 238-251, 2017. URL: https://doi.org/10.1145/3055399.3055408.
  37. Wolfgang Woess. Random walks on infinite graphs and groups, volume 138 of Cambridge Tracts in Mathematics. Cambridge University Press, Cambridge, 2000. URL: https://doi.org/10.1017/CBO9780511470967.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact