Accelerated Distributed Laplacian Solvers via Shortcuts

09/11/2021
by   Ioannis Anagnostides, et al.
0

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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

08/03/2021

Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model

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

Minor Sparsifiers and the Distributed Laplacian Paradigm

We study distributed algorithms built around edge contraction based vert...
06/03/2021

Low-Congestion Shortcuts in Constant Diameter Graphs

Low congestion shortcuts, introduced by Ghaffari and Haeupler (SODA 2016...
01/16/2018

Round- and Message-Optimal Distributed Part-Wise Aggregation

Distributed graph algorithms that separately optimize for either the num...
05/13/2019

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...
08/26/2019

Low-Congestion Shortcut and Graph Parameters

The concept of low-congestion shortcuts is initiated by Ghaffari and Hae...
05/13/2021

On Sparsity Awareness in Distributed Computations

We extract a core principle underlying seemingly different fundamental d...
This week in AI

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