Derandomizing local distributed algorithms under bandwidth restrictions

This paper addresses the cornerstone family of local problems in distributed computing, and investigates the curious gap between randomized and deterministic solutions under bandwidth restrictions. Our main contribution is in providing tools for derandomizing solutions to local problems, when the n nodes can only send O(log n)-bit messages in each round of communication. We combine bounded independence, which we show to be sufficient for some algorithms, with the method of conditional expectations and with additional machinery, to obtain the following results. First, we show that in the Congested Clique model, which allows all-to-all communication, there is a deterministic maximal independent set (MIS) algorithm that runs in O(log² Δ) rounds, where Δ is the maximum degree. When Δ = O(n^1/3), the bound improves to O(log Δ). Adapting the above to the CONGEST model gives an O(Dlog² n)-round deterministic MIS algorithm, where D is the diameter of the graph. Apart from a previous unproven claim of a O(Dlog³ n)-round algorithm, the only known deterministic solutions for the CONGEST model are a coloring-based O(Δ+log^∗ n)-round algorithm, where Δ is the maximal degree in the graph, and a 2^O(√ log n log log n)-round algorithm, which is super-polylogarithmic in n. In addition, we deterministically construct a (2κ-1)-spanner with O(κn^1+1/κ log n) edges in O(κ log n) rounds in the Congested Clique model. For comparison, in the more stringent CONGEST model, where the communication graph is identical to the input graph, the best deterministic algorithm for constructing a (2κ-1)-spanner with O(κn^1+1/κ) edges runs in O(n^1-1/κ) rounds.