DeepAI AI Chat
Log In Sign Up

Accelerated Distributed Laplacian Solvers via Shortcuts

by   Ioannis Anagnostides, et al.

In this work we refine the analysis of the distributed Laplacian solver recently established by Forster, Goranci, Liu, Peng, Sun, and Ye (FOCS '21), via the Ghaffari-Haeupler framework (SODA '16) of low-congestion shortcuts. Specifically, if ϵ > 0 represents the error of the solver, we derive two main results. First, for any n-node graph G with hop-diameter D and treewidth bounded by k, we show the existence of a Laplacian solver with round complexity O(n^o(1)kD log(1/ϵ)) in the CONGEST model. For graphs with bounded treewidth this circumvents the notorious Ω(√(n)) lower bound for "global" problems in general graphs. Moreover, following a recent line of work in distributed algorithms, we consider a hybrid communication model which enhances CONGEST with very limited global power in the form of the recently introduced node-capacitated clique. In this model, we show the existence of a Laplacian solver with round complexity O(n^o(1)log(1/ϵ)). The unifying thread of these results is an application of accelerated distributed algorithms for a congested variant of the standard part-wise aggregation problem that we introduce. This primitive constitutes the primary building block for simulating "local" operations on low-congestion minors, and we believe that this framework could be more generally applicable.


page 1

page 2

page 3

page 4


Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model

The model was recently introduced by Augustine et al. <cit.> in order t...

Minor Sparsifiers and the Distributed Laplacian Paradigm

We study distributed algorithms built around edge contraction based vert...

A Simple and Efficient Parallel Laplacian Solver

A symmetric matrix is called a Laplacian if it has nonpositive off-diago...

Low-Congestion Shortcuts in Constant Diameter Graphs

Low congestion shortcuts, introduced by Ghaffari and Haeupler (SODA 2016...

A Distributed Laplacian Solver and its Applications to Electrical Flow and Random Spanning Tree Computation

We present a distributed solver for a large and important class of Lapla...

The Laplacian Paradigm in the Broadcast Congested Clique

In this paper, we bring the main tools of the Laplacian paradigm to the ...