Bernoulli Factories for Flow-Based Polytopes
From MaRDI portal
Publication:6202751
DOI10.1137/23m1558343arXiv2207.08965OpenAlexW4391574411MaRDI QIDQ6202751
Jon Schneider, Renato Paes Leme, Rad Niazadeh
Publication date: 27 February 2024
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2207.08965
Computational methods for problems pertaining to probability theory (60-08) Algebraic combinatorics (05E99) General topics in the theory of algorithms (68W01)
Cites Work
- Unnamed Item
- Barker's algorithm for Bayesian inference with intractable likelihoods
- Fast simulation of new coins from old
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- From the Bernoulli factory to a dice enterprise via perfect sampling of Markov chains
- New coins from old: Computing with unknown bias
- Combinatorial Bernoulli factories
- How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
- A Bernoulli factory
- Stationarity detection in the initial transient problem
- Bernoulli factories and black-box reductions in mechanism design