A Dynamic Programming Approach for Approximate Uniform Generation of Binary Matrices with Specified Margins
Computation
2013-01-28 v2
Abstract
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.
Cite
@article{arxiv.0906.1004,
title = {A Dynamic Programming Approach for Approximate Uniform Generation of Binary Matrices with Specified Margins},
author = {Matthew T. Harrison},
journal= {arXiv preprint arXiv:0906.1004},
year = {2013}
}
Comments
27 pages, minor typographic corrections from previous version, superseded by arXiv:1301.3928