Bernoulli Factories for Flow-Based Polytopes

IF 0.9 3区数学 Q2 MATHEMATICS SIAM Journal on Discrete Mathematics Pub Date : 2024-02-06 DOI:10.1137/23m1558343

Rad Niazadeh, Renato Paes Leme, Jon Schneider

引用次数: 0

Abstract

SIAM Journal on Discrete Mathematics, Volume 38, Issue 1, Page 726-742, March 2024.
Abstract. We construct explicit combinatorial Bernoulli factories for the following class of 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 [math]-flows. In the process, we uncover new connections to algebraic combinatorics.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

基于流的多面体的伯努利工厂

SIAM 离散数学杂志》，第 38 卷，第 1 期，第 726-742 页，2024 年 3 月。摘要。我们为以下一类基于流的多面体构建了显式组合伯努利工厂：由一组网络流约束定义的积分 0/1 多面体。这推广了 Niazadeh 等人的研究成果（他们为双方格完全匹配的特定情况构建了一个显式工厂），并为路径、循环和 [math] 流的采样提供了新的精确采样程序。在此过程中，我们发现了代数组合学的新联系。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

SIAM Journal on Discrete Mathematics 数学-应用数学

CiteScore

1.90

自引率

0.00%

发文量

124

审稿时长

4-8 weeks

期刊介绍： SIAM Journal on Discrete Mathematics (SIDMA) publishes research papers of exceptional quality in pure and applied discrete mathematics, broadly interpreted. The journal''s focus is primarily theoretical rather than empirical, but the editors welcome papers that evolve from or have potential application to real-world problems. Submissions must be clearly written and make a significant contribution. Topics include but are not limited to: properties of and extremal problems for discrete structures combinatorial optimization, including approximation algorithms algebraic and enumerative combinatorics coding and information theory additive, analytic combinatorics and number theory combinatorial matrix theory and spectral graph theory design and analysis of algorithms for discrete structures discrete problems in computational complexity discrete and computational geometry discrete methods in computational biology, and bioinformatics probabilistic methods and randomized algorithms.

期刊最新文献

Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs On the Minimum Number of Arcs in \(\boldsymbol{k}\)-Dicritical Oriented Graphs A Stability Result of the Pósa Lemma A Stability Result for \(\boldsymbol{C}_{\boldsymbol{2k+1}}\)-Free Graphs Tuza’s Conjecture for Binary Geometries