Sparsified Block Elimination for Directed Laplacians

11/19/2021
โˆ™
by   Richard Peng, et al.
โˆ™
0
โˆ™

We show that the sparsified block elimination algorithm for solving undirected Laplacian linear systems from [Kyng-Lee-Peng-Sachdeva-Spielman STOC'16] directly works for directed Laplacians. Given access to a sparsification algorithm that, on graphs with n vertices and m edges, takes time ๐’ฏ_ S(m) to output a sparsifier with ๐’ฉ_ S(n) edges, our algorithm solves a directed Eulerian system on n vertices and m edges to ฯต relative accuracy in time O(๐’ฏ_ S(m) + ๐’ฉ_ S(n)lognlog(n/ฯต)) + ร•(๐’ฏ_ S(๐’ฉ_ S(n)) log n), where the ร•(ยท) notation hides loglog(n) factors. By previous results, this implies improved runtimes for linear systems in strongly connected directed graphs, PageRank matrices, and asymmetric M-matrices. When combined with slower constructions of smaller Eulerian sparsifiers based on short cycle decompositions, it also gives a solver that runs in O(n log^5n log(n / ฯต)) time after O(n^2 log^O(1) n) pre-processing. At the core of our analyses are constructions of augmented matrices whose Schur complements encode error matrices.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

โˆ™ 05/30/2018

Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions

We develop a framework for graph sparsification and sketching, based on ...
โˆ™ 12/10/2019

High-precision Estimation of Random Walks in Small Space

In this paper, we provide a deterministic ร•(log N)-space algorithm for e...
โˆ™ 11/27/2019

Roundtrip Spanners with (2k-1) Stretch

A roundtrip spanner of a directed graph G is a subgraph of G preserving ...
โˆ™ 10/17/2019

Solving Linear Programs with Sqrt(rank) Linear System Solves

We present an algorithm that given a linear program with n variables, m ...
โˆ™ 02/28/2020

On Fast Computation of Directed Graph Laplacian Pseudo-Inverse

The Laplacian matrix and its pseudo-inverse for a strongly connected dir...
โˆ™ 11/17/2020

Ultrasparse Ultrasparsifiers and Faster Laplacian System Solvers

In this paper we provide an O(m (loglog n)^O(1)log(1/ฯต))-expected time a...
โˆ™ 12/03/2019

Sometimes Reliable Spanners of Almost Linear Size

Reliable spanners can withstand huge failures, even when a linear number...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.