Probabilistic Logarithmic-Space Algorithms for Laplacian Solvers
A recent series of breakthroughs initiated by Spielman and Teng culminated in the construction of nearly linear time Laplacian solvers, approximating the solution of a linear system Lx=b, where L is the normalized Laplacian of an undirected graph. In this paper we study the space complexity of the problem. Surprisingly we are able to show a probabilistic, logspace algorithm solving the problem. We further extend the algorithm to other families of graphs like Eulerian graphs (and directed regular graphs) and graphs that mix in polynomial time.
Our approach is to pseudo-invert the Laplacian, by first "peeling-off" the problematic kernel of the operator, and then to approximate the inverse of the remaining part by using a Taylor series. We approximate the Taylor series using a previous work and the special structure of the problem. For directed graphs we exploit in the analysis the Jordan normal form and results from matrix functions.
Laplacian solvers
Randomized logspace
Bounded-space complexity classes
Random walks
Matrix computation
41:1-41:20
Regular Paper
Dean
Doron
Dean Doron
François
Le Gall
François Le Gall
Amnon
Ta-Shma
Amnon Ta-Shma
10.4230/LIPIcs.APPROX-RANDOM.2017.41
Romas Aleliunas, Richard M. Karp, Richard J. Lipton, László Lovász, and Charles Rackoff. Random walks, universal traversal sequences, and the complexity of maze problems. In Proceedings of the 20th Annual Symposium on Foundations of Computer Science, pages 218-223, 1979.
Carme Alvarez and Raymond Greenlaw. A compendium of problems complete for symmetric logarithmic space. Computational Complexity, 9(2):123-145, 2000.
Frank Bauer. Normalized graph laplacians for directed graphs. Linear Algebra and its Applications, 436(11):4193-4222, 2012.
Adi Ben-Israel and Thomas N. E. Greville. Generalized inverses: theory and applications, volume 15. Springer, 2003.
Stuart J. Berkowitz. On computing the determinant in small parallel time using a small number of processors. Information Processing Letters, 18(3):147-150, 1984. URL: http://dx.doi.org/10.1016/0020-0190(84)90018-8.
http://dx.doi.org/10.1016/0020-0190(84)90018-8
Anders Björner and László Lovász. Chip-firing games on directed graphs. Journal of Algebraic Combinatorics, 1(4):305-328, 1992.
Allan Borodin, Joachim von zur Gathen, and John E. Hopcroft. Fast parallel matrix and GCD computations. Information and Control, 52(3):241-256, 1982. URL: http://dx.doi.org/10.1016/S0019-9958(82)90766-5.
http://dx.doi.org/10.1016/S0019-9958(82)90766-5
Richard Bronson. Matrix Methods: an Introduction. Gulf Professional Publishing, 1991.
William Clough Brown. A Second Course in Linear Algebra. Wiley-Interscience, 1988.
Fan R. K. Chung. Laplacian of graphs and cheeger’s inequalities. Combinatorics, Paul Erdos is Eighty, 2(157-172):13-2, 1996.
Fan R. K. Chung. Spectral Graph Theory. American Mathematical Society, 1997.
Fan R. K. Chung. Laplacians and the cheeger inequality for directed graphs. Annals of Combinatorics, 9(1):1-19, 2005.
Michael B. Cohen, Jonathan Kelner, John Peebles, Richard Peng, Aaron Sidford, and Adrian Vladu. Faster algorithms for computing the stationary distribution, simulating random walks, and more. In Proceedings of the 57th Annual Symposium on Foundations of Computer Science, pages 583-592, 2016.
Laszlo Csanky. Fast parallel matrix inversion algorithms. SIAM Journal of Computing, 5(6):618-623, 1976.
James W. Demmel. Applied numerical linear algebra. Society for Industrial and Applied Mathematics, 1997.
Dean Doron, Amir Sarid, and Amnon Ta-Shma. On approximating the eigenvalues of stochastic matrices in probabilistic logspace. Computational Complexity, pages 1-28, 2016.
Dean Doron and Amnon Ta-Shma. On the problem of approximating the eigenvalues of undirected graphs in probabilistic logspace. In Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming, pages 419-431, 2015.
Bill Fefferman and Cedric Yen-Yu Lin. A complete characterization of unitary quantum space. arXiv preprint arXiv:1604.01384, 2016.
Peter W. Glynn. Upper bounds on poisson tail probabilities. Operations Research Letters, 6(1):9-14, 1987.
Chris Godsil. Eigenvalues of graphs and digraphs. Linear Algebra and its Applications, 46:43-50, 1982.
Chris Godsil and Gordon F. Royle. Algebraic Graph Theory. Springer, 2013.
Gene H. Golub and Charles F. Van Loan. Matrix Computations. Johns Hopkins University Press, Baltimore, MD, USA, 3rd edition, 1996.
Nicholas J. Higham. Functions of Matrices: Theory and Computation. Society for Industrial and Applied Mathematics, 2008.
Jonathan A. Kelner, Lorenzo Orecchia, Aaron Sidford, and Zeyuan Allen Zhu. A simple, combinatorial algorithm for solving SDD systems in nearly-linear time. In Proceedings of the 45th Annual Symposium on Theory of Computing, pages 911-920, 2013. URL: http://dx.doi.org/10.1145/2488608.2488724.
http://dx.doi.org/10.1145/2488608.2488724
Adam R. Klivans and Dieter Van Melkebeek. Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses. SIAM Journal on Computing, 31(5):1501-1526, 2002.
Harry R. Lewis and Christos H. Papadimitriou. Symmetric space-bounded computation. Theoretical Computer Science, 19(2):161-187, 1982.
Noam Nisan. Pseudorandom generators for space-bounded computation. Combinatorica, 12(4):449-461, 1992.
Noam Nisan. RL⊆SC. Computational Complexity, 4(1):1-11, 1994.
Richard Peng and Daniel A. Spielman. An efficient parallel solver for SDD linear systems. In Proceedings of the 46th Annual Symposium on Theory of Computing, pages 333-342, 2014. URL: http://dx.doi.org/10.1145/2591796.2591832.
http://dx.doi.org/10.1145/2591796.2591832
Omer Reingold. Undirected connectivity in log-space. Journal of the ACM, 55(4), 2008.
Michael E. Saks and Shiyu Zhou. BP_HSPACE(S) ⊆ DSPACE(S^3/2). Journal of Computer and System Sciences, 58(2):376-403, 1999.
Russell A. Smith. The condition numbers of the matrix eigenvalue problem. Numerische Mathematik, 10(3):232-240, 1967.
Daniel A. Spielman and Shang-Hua Teng. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In Proceedings of the 36th Annual Symposium on Theory of Computing, pages 81-90, 2004. URL: http://dx.doi.org/10.1145/1007352.1007372.
http://dx.doi.org/10.1145/1007352.1007372
Daniel A. Spielman and Shang-Hua Teng. Spectral sparsification of graphs. SIAM Journal on Computing, 40(4):981-1025, 2011. URL: http://dx.doi.org/10.1137/08074489X.
http://dx.doi.org/10.1137/08074489X
Daniel A. Spielman and Shang-Hua Teng. A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning. SIAM Journal on Computing, 42(1):1-26, 2013. URL: http://dx.doi.org/10.1137/080744888.
http://dx.doi.org/10.1137/080744888
Daniel A. Spielman and Shang-Hua Teng. Nearly linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems. SIAM Journal on Matrix Analysis and Applications, 35(3):835-885, 2014. URL: http://dx.doi.org/10.1137/090771430.
http://dx.doi.org/10.1137/090771430
Amnon Ta-Shma. Inverting well conditioned matrices in quantum logspace. In Proceedings of the 45th Annual Symposium on Theory of Computing, pages 881-890, 2013. URL: http://dx.doi.org/10.1145/2488608.2488720.
http://dx.doi.org/10.1145/2488608.2488720
Vladimir Trifonov. An O(log nlog log n) space algorithm for undirected st-connectivity. SIAM Journal on Computing, 38(2):449-483, 2008.
Nisheeth K. Vishnoi. Lx = b - Laplacian Solvers and their Algorithmic Applications. Now publishers, 2013.
John Watrous. Space-bounded quantum complexity. Journal of Computer and System Sciences, 59(2):281-326, 1999.
Creative Commons Attribution 3.0 Unported license
https://creativecommons.org/licenses/by/3.0/legalcode