Sublinear-Time Sampling of Spanning Trees in the Congested Clique

TL;DR

This paper introduces a groundbreaking sublinear-time distributed algorithm for sampling approximately uniform spanning trees in the Congested Clique model, utilizing novel techniques like walk shortcutting and compressed walk reconstruction.

Contribution

It presents the first sublinear-round algorithm for approximate uniform spanning tree sampling in the Congested Clique, with innovative methods for walk shortcutting and efficient random walk reconstruction.

Findings

Achieves $ ilde{O}(n^{0.657})$ rounds for approximate sampling.

Provides an $O(n^{2/3+eta})$-round algorithm for exact sampling.

Introduces a new compressed random walk reconstruction technique.

Abstract

We present the first sublinear-in-$n$ round algorithm for sampling an approximately uniform spanning tree of an $n$-vertex graph in the CongestedClique model of distributed computing. In particular, our algorithm requires $\Tilde{O}(n^{0.657})$ rounds for sampling a spanning tree within total variation distance $1/n^c$, for arbitrary constant $c > 0$, from the uniform distribution. More precisely, our algorithm requires $\Tilde{O}(n^{1/2 + \alpha})$ rounds, where $O(n^\alpha)$ is the running time of matrix multiplication in the CongestedClique model (currently $\alpha = 1 - 2/\omega = 0.157$, where $\omega$ is the sequential matrix multiplication time exponent). We can adapt our algorithm to give exact rather than approximate samples, but with a larger, though still $o(n)$, runtime of $\Tilde{O}(n^{2/3+\alpha}) = O(n^{.824})$. In a remarkable result, Aldous (SIDM 1990) and Broder (FOCS 1989) showed that the first visit edge to each vertex, excluding the start vertex, during a random walk forms a uniformly chosen spanning tree of the underlying graph. Our algorithm is a significant departure from known techniques, featuring a top-down walk filling approach paired with Schur complement graphs for walk shortcutting. To make this idea work in the CongestedClique model, we present a novel compressed random walk reconstruction algorithm, based on randomly sampling a weighted perfect matching. In addition, we show how to take somewhat shorter random walks even more efficiently in the CongestedClique model, obtaining an $O(\log^3 n)$-round algorithm for uniformly sampling spanning trees from graphs with $O(n\log n)$ cover times. These results are obtained by adding a load balancing component to the random walk algorithm of Bahmani, Chakrabarti and Xin (SIGMOD 2011) that uses the bottom-up ``doubling'' technique.