Matches in SemOpenAlex for { <https://semopenalex.org/work/W2888277944> ?p ?o ?g. }
- W2888277944 abstract "In this paper, we show how to solve directed Laplacian systems in nearly-linear time. Given a linear system in an n × n Eulerian directed Laplacian with m nonzero entries, we show how to compute an ε-approximate solution in time O(m log <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>O(1)</sup> (n) log (1/ε)). Through reductions from [Cohen et al. FOCS'16], this gives the first nearly-linear time algorithms for computing ε-approximate solutions to row or column diagonally dominant linear systems (including arbitrary directed Laplacians) and computing ε-approximations to various properties of random walks on directed graphs, including stationary distributions, personalized PageRank vectors, hitting times, and escape probabilities. These bounds improve upon the recent almost-linear algorithms of [Cohen et al. STOC'17], which gave an algorithm to solve Eulerian Laplacian systems in time O((m+n2 <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>O(√ log n log log n)</sup> )log <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>O(1)</sup> (n ε <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>-1</sup> )). To achieve our results, we provide a structural result that we believe is of independent interest. We show that Eulerian Laplacians (and therefore the Laplacians of all strongly connected directed graphs) have sparse approximate LU-factorizations. That is, for every such directed Laplacian there are lower upper triangular matrices each with at most Õ(n) nonzero entries such that there product spectrally approximates the directed Laplacian in an appropriate norm. This claim can be viewed as an analog of recent work on sparse Cholesky factorizations of Laplacians of undirected graphs. We show how to construct such factorizations in nearly-linear time and prove that once constructed they yield nearly-linear time algorithms for solving directed Laplacian systems." @default.
- W2888277944 created "2018-08-31" @default.
- W2888277944 creator A5015009174 @default.
- W2888277944 creator A5022068777 @default.
- W2888277944 creator A5034026499 @default.
- W2888277944 creator A5053449713 @default.
- W2888277944 creator A5058487388 @default.
- W2888277944 creator A5059735243 @default.
- W2888277944 creator A5086787265 @default.
- W2888277944 date "2018-10-01" @default.
- W2888277944 modified "2023-09-30" @default.
- W2888277944 title "Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations" @default.
- W2888277944 cites W1560003866 @default.
- W2888277944 cites W1601422707 @default.
- W2888277944 cites W1916091028 @default.
- W2888277944 cites W1979505770 @default.
- W2888277944 cites W1983193888 @default.
- W2888277944 cites W2045107949 @default.
- W2888277944 cites W2066308383 @default.
- W2888277944 cites W2073647817 @default.
- W2888277944 cites W2084990336 @default.
- W2888277944 cites W2089703809 @default.
- W2888277944 cites W2102560346 @default.
- W2888277944 cites W2109176946 @default.
- W2888277944 cites W2129027292 @default.
- W2888277944 cites W2133352257 @default.
- W2888277944 cites W2148025043 @default.
- W2888277944 cites W2153441719 @default.
- W2888277944 cites W2164853353 @default.
- W2888277944 cites W2278710066 @default.
- W2888277944 cites W2295766446 @default.
- W2888277944 cites W2547436936 @default.
- W2888277944 cites W2552685338 @default.
- W2888277944 cites W2570775423 @default.
- W2888277944 cites W2963324223 @default.
- W2888277944 cites W2963541115 @default.
- W2888277944 cites W2963751092 @default.
- W2888277944 cites W2964070071 @default.
- W2888277944 cites W3104306072 @default.
- W2888277944 cites W4249075686 @default.
- W2888277944 doi "https://doi.org/10.1109/focs.2018.00089" @default.
- W2888277944 hasPublicationYear "2018" @default.
- W2888277944 type Work @default.
- W2888277944 sameAs 2888277944 @default.
- W2888277944 citedByCount "19" @default.
- W2888277944 countsByYear W28882779442018 @default.
- W2888277944 countsByYear W28882779442019 @default.
- W2888277944 countsByYear W28882779442020 @default.
- W2888277944 countsByYear W28882779442021 @default.
- W2888277944 countsByYear W28882779442022 @default.
- W2888277944 countsByYear W28882779442023 @default.
- W2888277944 crossrefType "proceedings-article" @default.
- W2888277944 hasAuthorship W2888277944A5015009174 @default.
- W2888277944 hasAuthorship W2888277944A5022068777 @default.
- W2888277944 hasAuthorship W2888277944A5034026499 @default.
- W2888277944 hasAuthorship W2888277944A5053449713 @default.
- W2888277944 hasAuthorship W2888277944A5058487388 @default.
- W2888277944 hasAuthorship W2888277944A5059735243 @default.
- W2888277944 hasAuthorship W2888277944A5086787265 @default.
- W2888277944 hasBestOaLocation W28882779442 @default.
- W2888277944 hasConcept C114614502 @default.
- W2888277944 hasConcept C115178988 @default.
- W2888277944 hasConcept C118615104 @default.
- W2888277944 hasConcept C127413603 @default.
- W2888277944 hasConcept C130367717 @default.
- W2888277944 hasConcept C132525143 @default.
- W2888277944 hasConcept C134306372 @default.
- W2888277944 hasConcept C165700671 @default.
- W2888277944 hasConcept C2524010 @default.
- W2888277944 hasConcept C2779172887 @default.
- W2888277944 hasConcept C2780428219 @default.
- W2888277944 hasConcept C28826006 @default.
- W2888277944 hasConcept C311688 @default.
- W2888277944 hasConcept C33923547 @default.
- W2888277944 hasConcept C41008148 @default.
- W2888277944 hasConcept C43058520 @default.
- W2888277944 hasConcept C53469067 @default.
- W2888277944 hasConcept C63553672 @default.
- W2888277944 hasConcept C78519656 @default.
- W2888277944 hasConcept C80444323 @default.
- W2888277944 hasConceptScore W2888277944C114614502 @default.
- W2888277944 hasConceptScore W2888277944C115178988 @default.
- W2888277944 hasConceptScore W2888277944C118615104 @default.
- W2888277944 hasConceptScore W2888277944C127413603 @default.
- W2888277944 hasConceptScore W2888277944C130367717 @default.
- W2888277944 hasConceptScore W2888277944C132525143 @default.
- W2888277944 hasConceptScore W2888277944C134306372 @default.
- W2888277944 hasConceptScore W2888277944C165700671 @default.
- W2888277944 hasConceptScore W2888277944C2524010 @default.
- W2888277944 hasConceptScore W2888277944C2779172887 @default.
- W2888277944 hasConceptScore W2888277944C2780428219 @default.
- W2888277944 hasConceptScore W2888277944C28826006 @default.
- W2888277944 hasConceptScore W2888277944C311688 @default.
- W2888277944 hasConceptScore W2888277944C33923547 @default.
- W2888277944 hasConceptScore W2888277944C41008148 @default.
- W2888277944 hasConceptScore W2888277944C43058520 @default.
- W2888277944 hasConceptScore W2888277944C53469067 @default.
- W2888277944 hasConceptScore W2888277944C63553672 @default.
- W2888277944 hasConceptScore W2888277944C78519656 @default.
- W2888277944 hasConceptScore W2888277944C80444323 @default.