%AChatterjee, Soumyottam%APandurangan, Gopal%APham, Nguyen%BJournal Name: ICDCN 2020: Proceedings of the 21st International Conference on Distributed Computing and Networking
%D2020%I
%JJournal Name: ICDCN 2020: Proceedings of the 21st International Conference on Distributed Computing and Networking
%K
%MOSTI ID: 10169205
%PMedium: X; Size: 1 to 10
%TDistributed MST: A Smoothed Analysis
%XWe 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--¼) 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, 1 computes an MST and runs in Õ(min{1/√ϵ(n)2O(√log n), D+ √n}) rounds2 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 2O(√log n) polylog(n) factor.
Our work can be considered as a first step in understanding the smoothed complexity of distributed graph algorithms.
%0Journal Article
Country unknown/Code not availablehttps://doi.org/10.1145/3369740.3369778OSTI-MSA