2 papers
cs.DC2025
Congested Clique Counting for Local Gibbs Distributions
Joshua Z. Sobel
There are well established reductions between combinatorial sampling and counting problems (Jerrum, Valiant, Vazirani TCS 1986). Building off of a very recent parallel algorithm ut…
cs.DC2025
Sublinear-Time Sampling of Spanning Trees in the Congested Clique
Sriram V. Pemmaraju, Sourya Roy, Joshua Z. Sobel
We present the first sublinear-in- round algorithm for sampling an approximately uniform spanning tree of an -vertex graph in the CongestedClique model of distributed computi…