A Combinatorial Cut-Based Algorithm for Solving Laplacian Linear Systems

10/30/2020
by   Monika Henzinger, et al.
0

Over the last two decades, a significant line of work in theoretical algorithms has been progress in solving linear systems of the form 𝐋𝐩 = 𝐛, where 𝐋 is the Laplacian matrix of a weighted graph with weights w(i,j)>0 on the edges. The solution 𝐩 of the linear system can be interpreted as the potentials of an electrical flow. Kelner, Orrechia, Sidford, and Zhu <cit.> give a combinatorial, near-linear time algorithm that maintains the Kirchoff Current Law, and gradually enforces the Kirchoff Potential Law. Here we consider a dual version of the algorithm that maintains the Kirchoff Potential Law, and gradually enforces the Kirchoff Current Law. We prove that this dual algorithm also runs in a near-linear number of iterations. Each iteration requires updating all potentials on one side of a fundamental cut of a spanning tree by a fixed amount. If this update step can be performed in polylogarithmic time, we can also obtain a near-linear time algorithm to solve 𝐋𝐩 = 𝐛. However, if we abstract this update step as a natural data structure problem, we show that we can use the data structure to solve a problem that has been conjectured to be difficult for dynamic algorithms, the online vector-matrix-vector problem <cit.>. The conjecture implies that the data structure does not have an O(n^1-ϵ) time algorithm for any ϵ > 0. Thus our dual algorithm cannot be near-linear time algorithm for solving 𝐋𝐩 = 𝐛 unless we are able to take advantage of the structure of the particular update steps that our algorithm uses.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/13/2020

Cut-Equivalent Trees are Optimal for Min-Cut Queries

Min-Cut queries are fundamental: Preprocess an undirected edge-weighted ...
research
09/02/2021

Cut-Toggling and Cycle-Toggling for Electrical Flow and Other p-Norm Flows

We study the problem of finding flows in undirected graphs so as to mini...
research
03/01/2022

Fair Cuts, Approximate Isolating Cuts, and Approximate Gomory-Hu Trees in Near-Linear Time

In this paper, we introduce a robust notion of (1+ϵ)-approximate (s, t)-...
research
10/02/2020

Decremental APSP in Directed Graphs Versus an Adaptive Adversary

Given a directed graph G = (V,E), undergoing an online sequence of edge ...
research
08/30/2023

Decomposing Triangulations into 4-Connected Components

A connected graph is 4-connected if it contains at least five vertices a...
research
04/11/2018

Graph Sketching Against Adaptive Adversaries Applied to the Minimum Degree Algorithm

Motivated by the study of matrix elimination orderings in combinatorial ...
research
04/06/2020

Random Osborne: a simple, practical algorithm for Matrix Balancing in near-linear time

We revisit Matrix Balancing, a pre-conditioning task used ubiquitously f...

Please sign up or login with your details

Forgot password? Click here to reset