Bernoulli Factories for Flow-Based Polytopes
From MaRDI portal
Abstract: We construct explicit combinatorial Bernoulli factories for the class of emph{flow-based polytopes}; integral 0/1-polytopes defined by a set of network flow constraints. This generalizes the results of Niazadeh et al. (who constructed an explicit factory for the specific case of bipartite perfect matchings) and provides novel exact sampling procedures for sampling paths, circulations, and -flows. In the process, we uncover new connections to algebraic combinatorics.
Recommendations
Cites work
- A Bernoulli factory
- Barker's algorithm for Bayesian inference with intractable likelihoods
- Bernoulli factories and black-box reductions in mechanism design
- Combinatorial Bernoulli factories
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Fast simulation of new coins from old
- From the Bernoulli factory to a dice enterprise via perfect sampling of Markov chains
- How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
- scientific article; zbMATH DE number 3047763 (Why is no real title available?)
- New coins from old: Computing with unknown bias
- Stationarity detection in the initial transient problem
This page was built for publication: Bernoulli Factories for Flow-Based Polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6202751)