On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries
The problems of uniformly sampling and approximately counting contingency tables have been widely studied, but efficient solutions are only known in special cases. One appealing approach is the Diaconis and Gangolli Markov chain which updates the entries of a random 2×2 submatrix. This chain is known to be rapidly mixing for cell-bounded tables only when the cell bounds are all 1 and the row and column sums are regular. We demonstrate that the chain can require exponential time to mix in the cell-bounded case, even if we restrict to instances for which the state space is connected. Moreover, we show the chain can be slowly mixing even if we restrict to natural classes of problem instances, including regular instances with cell bounds of either 0 or 1 everywhere, and dense instances where at least a linear number of cells in each row or column have non-zero cell-bounds.
KeywordsContingency tables Cell bounds Markov chains Mixing rates Fpras
Unable to display preview. Download preview PDF.
- Cryan M, Dyer M, Goldberg L, Jerrum M, Martin R (2002) Rapidly mixing Markov chains for sampling contingency tables with a constant number of rows. In: Proc 43rd IEEE symposium on foundations of computer science, pp 711–720 Google Scholar
- Cryan M, Dyer M, Randall D (2005) Approximately counting integral flows and cell-bounded contingency tables. In: Proc 37th ACM symposium on theory of computing, pp 413–422 Google Scholar
- Dyer M (2003) Approximate counting by dynamic programming. In: Proc 35th ACM symposium on the theory of computing, pp 693–699 Google Scholar
- Mount J (1995) Application of convex sampling to optimization and contingency table generation. PhD thesis, Carnegie Mellon University. (Technical report CMU-CS-95-152, Department of Computer Science) Google Scholar