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. 1998 ACM Subject Classification F.2.1 Numerical Algorithms and Problems

[1]  Zeyuan Allen Zhu,et al.  A simple, combinatorial algorithm for solving SDD systems in nearly-linear time , 2013, STOC '13.

[2]  Shang-Hua Teng,et al.  A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning , 2008, SIAM J. Comput..

[3]  James Demmel,et al.  Applied Numerical Linear Algebra , 1997 .

[4]  P. Glynn.  Upper bounds on Poisson tail probabilities , 1987 .

[5]  Vladimir Trifonov.  An O(log n log log n) space algorithm for undirected st-connectivity , 2005, STOC '05.

[6]  Amnon Ta-Shma,et al.  On Approximating the Eigenvalues of Stochastic Matrices in Probabilistic Logspace , 2016, computational complexity.

[7]  László Lovász,et al.  Chip-Firing Games on Directed Graphs , 1992 .

[8]  Chris Godsil.  Eigenvalues of Graphs and Digraphs , 1982 .

[9]  Richard Peng,et al.  An efficient parallel solver for SDD linear systems , 2013, STOC.

[10]  Shang-Hua Teng,et al.  Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems , 2003, STOC '04.

[11]  Bill Fefferman,et al.  A Complete Characterization of Unitary Quantum Space , 2016, ITCS.

[12]  Stuart J. Berkowitz,et al.  On Computing the Determinant in Small Parallel Time Using a Small Number of Processors , 1984, Inf. Process. Lett..

[13]  Nicholas J. Higham,et al.  Functions of matrices - theory and computation , 2008 .

[14]  Noam Nisan,et al.  RL⊆SC , 1992, STOC '92.

[15]  R. A. Smith.  The condition numbers of the matrix eigenvalue problem , 1967 .

[16]  Amnon Ta-Shma,et al.  On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace , 2015, ICALP.

[17]  Dieter van Melkebeek,et al.  Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses , 1999, STOC '99.

[18]  Richard J. Lipton,et al.  Random walks, universal traversal sequences, and the complexity of maze problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[19]  John Watrous,et al.  Space-Bounded Quantum Complexity , 1999, J. Comput. Syst. Sci..

[20]  L. Csanky,et al.  Fast parallel matrix inversion algorithms , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[21]  BPHSPACE ( S ) DSPACE ( S 3 2 ) * , 1999 .

[22]  Allan Borodin,et al.  Fast parallel matrix and GCD computations , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[23]  Amnon Ta-Shma,et al.  Inverting well conditioned matrices in quantum logspace , 2013, STOC '13.

[24]  Adi Ben-Israel,et al.  Generalized inverses: theory and applications , 1974 .

[25]  Shang-Hua Teng,et al.  Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems , 2006, SIAM J. Matrix Anal. Appl..

[26]  Frank Bauer.  Normalized graph Laplacians for directed graphs , 2011 .

[27]  Omer Reingold,et al.  Undirected connectivity in log-space , 2008, JACM.

[28]  Richard Peng,et al.  Faster Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and More , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

[29]  Shang-Hua Teng,et al.  Spectral Sparsification of Graphs , 2008, SIAM J. Comput..

[30]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[31]  Richard Bronson,et al.  Matrix Methods: An Introduction , 1969 .

[32]  Carme Àlvarez,et al.  A compendium of problems complete for symmetric logarithmic space , 2000, computational complexity.

[33]  Robert H. Halstead,et al.  Matrix Computations , 2011, Encyclopedia of Parallel Computing.

[34]  Vladimir Trifonov,et al.  An O(log n log log n) space algorithm for undirected st-connectivity , 2005, STOC '05.

[35]  Noam Nisan,et al.  Pseudorandom generators for space-bounded computation , 1992, Comb..

[36]  F. Chung.  Laplacians and the Cheeger Inequality for Directed Graphs , 2005 .

[37]  Christos H. Papadimitriou,et al.  Symmetric Space-Bounded Computation , 1982, Theor. Comput. Sci..

[38]  U. Feige,et al.  Spectral Graph Theory , 2015 .

[39]  William C. Brown,et al.  A Second Course in Linear Algebra , 1988 .

[40]  Michael Saks,et al.  BP H SPACE(S)⊆DSPACE(S 3/2 ) , 1999, FOCS 1999.