Answers are grounded in this paper and cite their sources.
We give polynomial time algorithms for random sampling from a set of contingency tables, which is the set of m×n matrices with given row and column sums, provided the row and column sums are sufficiently large with respect to m, n. We use this to approximately count the number of such matrices. These problems are of interest in Statistics and Combinatorics.
No takes yet. Share an insight, caveat, or question.
Dyer et al. (1997) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: