Random walks on the vertices of transportation polytopes with constant number of sources
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximate counting by dynamic programming
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Journal of Computer and System Sciences - STOC 2002
Random generation of 2×2×...×2×Jcontingency tables
Theoretical Computer Science
Approximately counting integral flows and cell-bounded contingency tables
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Perfect sampling algorithm for small m×n contingency tables
Statistics and Computing
Markov bases of three-way tables are arbitrarily complicated
Journal of Symbolic Computation
Approximately Counting Integral Flows and Cell-Bounded Contingency Tables
SIAM Journal on Computing
On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries
Journal of Combinatorial Optimization
Hi-index | 0.00 |
We consider the problem of sampling almost uniformly from the set of contingency tables with given row and column sums, when the number of rows is a constant. Cryan and Dyer [3] have recently given a fully polynomial randomized approximation scheme (fpras) for the related counting problem, which only employs Markov chain methods indirectly. But they leave open the question as to whether a natural Markov chain on such tables mixes rapidly. Here we answer this question in the affirmative, and hence provide a very different proof of the main result of [3]. We show that the "2 脳 2 heat-bath" Markov chain is rapidly mixing. We prove this by considering first a heat-bath chain operating on a larger window. Using techniques developed by Morris and Sinclair [20] (see also Morris [19]) for the multidimensional knapsack problem, we show that this chain mixes rapidly. We then apply the comparison method of Diaconis and Saloff-Coste [8] to show that the 2 脳 2 chain is rapidly mixing. As part of our analysis, we give the first proof that the 2 脳 2 chain mixes in time polynomial in the input size when both the number of rows and the number of columns is constant.