具有指定边界的二元矩阵近似均匀生成的动态规划方法
A Dynamic Programming Approach for Approximate Uniform Generation of Binary Matrices with Specified Margins
摘要：
考虑具有特定行和列和序列的所有二进制矩阵的集合，并考虑从该集合中均匀地采样二进制矩阵。精确均匀采样的实用算法是未知的，但有近似均匀采样的实用算法。这里，它是如何动态规划和最近的渐近枚举结果可以用来简化和改善某类近似均匀采样。动态编程的观点提出了有趣的概括。
英文摘要：
Consider the collection of all binary matrices having a specific sequence of row and column sums and consider sampling binary matrices uniformly from this collection. Practical algorithms for exact uniform sampling are not known, but there are practical algorithms for approximate uniform sampling. Here it is shown how dynamic programming and recent asymptotic enumeration results can be used to simplify and improve a certain class of approximate uniform samplers. The dynamic programming perspective suggests interesting generalizations.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
