Sampling Arborescences in Parallel

12/17/2020
by   Nima Anari, et al.
0

We study the problem of sampling a uniformly random directed rooted spanning tree, also known as an arborescence, from a possibly weighted directed graph. Classically, this problem has long been known to be polynomial-time solvable; the exact number of arborescences can be computed by a determinant [Tut48], and sampling can be reduced to counting [JVV86, JS96]. However, the classic reduction from sampling to counting seems to be inherently sequential. This raises the question of designing efficient parallel algorithms for sampling. We show that sampling arborescences can be done in RNC. For several well-studied combinatorial structures, counting can be reduced to the computation of a determinant, which is known to be in NC [Csa75]. These include arborescences, planar graph perfect matchings, Eulerian tours in digraphs, and determinantal point processes. However, not much is known about efficient parallel sampling of these structures. Our work is a step towards resolving this mystery.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/19/2020

Simple Counting and Sampling Algorithms for Graphs with Bounded Pathwidth

In this paper, we consider the problem of counting and sampling structur...
research
07/03/2019

The Combinatorics of Barrier Synchronization

In this paper we study the notion of synchronization from the point of v...
research
03/21/2022

Improved Sampling-to-Counting Reductions in High-Dimensional Expanders and Faster Parallel Determinantal Sampling

We study parallel sampling algorithms for classes of distributions defin...
research
08/18/2023

Counting and Sampling Labeled Chordal Graphs in Polynomial Time

We present the first polynomial-time algorithm to exactly compute the nu...
research
12/17/2020

Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs

Counting and uniform sampling of directed acyclic graphs (DAGs) from a M...
research
09/15/2021

Fermion Sampling Made More Efficient

Fermion sampling is to generate probability distribution of a many-body ...
research
08/22/2023

Lifted Inference beyond First-Order Logic

Weighted First Order Model Counting (WFOMC) is fundamental to probabilis...

Please sign up or login with your details

Forgot password? Click here to reset