Distributed MST: A Smoothed Analysis

11/06/2019
by   Soumyottam Chatterjee, et al.
0

We study smoothed analysis of distributed graph algorithms, focusing on the fundamental minimum spanning tree (MST) problem. With the goal of studying the time complexity of distributed MST as a function of the "perturbation" of the input graph, we posit a smoothing model that is parameterized by a smoothing parameter 0 ≤ϵ(n) ≤ 1 which controls the amount of random edges that can be added to an input graph G per round. Informally, ϵ(n) is the probability (typically a small function of n, e.g., n^-1/4) that a random edge can be added to a node per round. The added random edges, once they are added, can be used (only) for communication. We show upper and lower bounds on the time complexity of distributed MST in the above smoothing model. We present a distributed algorithm that, with high probability,[%s] computes an MST and runs in Õ(min{1/√(ϵ(n)) 2^O(√(log n)), D + √(n)}) rounds[%s] where ϵ is the smoothing parameter, D is the network diameter and n is the network size. To complement our upper bound, we also show a lower bound of Ω̃(min{1/√(ϵ(n)), D+√(n)}). We note that the upper and lower bounds essentially match except for a multiplicative 2^O(√(log n))(n) factor. Our work can be considered as a first step in understanding the smoothed complexity of distributed graph algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/18/2022

Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds

We study the distributed minimum spanning tree (MST) problem, a fundamen...
research
11/18/2022

Asymptotically Tight Bounds on the Time Complexity of Broadcast and its Variants in Dynamic Networks

Data dissemination is a fundamental task in distributed computing. This ...
research
02/13/2020

Distributed Graph Realizations

We study graph realization problems from a distributed perspective and w...
research
07/13/2018

Parameterized Distributed Algorithms

In this work, we initiate a thorough study of parameterized graph optimi...
research
11/21/2022

Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method

The simplex method for linear programming is known to be highly efficien...
research
08/11/2022

Smoothed Analysis of Information Spreading in Dynamic Networks

The best known solutions for k-message broadcast in dynamic networks of ...
research
03/06/2020

Distributed Computation and Reconfiguration in Actively Dynamic Networks

In this paper, we study systems of distributed entities that can activel...

Please sign up or login with your details

Forgot password? Click here to reset