Reproduce “Fast Spanning Tree Sampling in Broadcast Congested Clique” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Nima Anari, Alireza Haqi
The authors present a distributed algorithm for sampling random spanning trees in the Broadcast Congested Clique. It estimates edge-inclusion probabilities, balances them by replicating edges, and repeatedly samples trees from small candidate sets gathered at one machine. For nonnegative integer weights bounded by U, it achieves total-variation error ε in log^C(n) log(nU) log(1/ε) rounds with high probability.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.