Abstract
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.
Similar content being viewed by others
References
Bezáková I, Bhatnagar N, Vigoda E (2007) Sampling binary contingency tables with a greedy start. Random Struct Algorithms 30:168–205
Cryan M, Dyer M (2003) A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant. J Comput Syst Sci 67:291–310
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
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
Diaconis P, Efron B (1995) Testing for independence in a two-way table: new interpretations of the chi-square statistic. Ann Stat 13:845–913
Diaconis P, Gangolli A (1995) Rectangular arrays with fixed margins. In: Aldous D et al. (eds) Discrete probability and algorithms. Springer, Berlin, pp 15–41
Dyer M (2003) Approximate counting by dynamic programming. In: Proc 35th ACM symposium on the theory of computing, pp 693–699
Dyer M, Kannan R, Mount J (1997) Sampling contingency tables. Random Struct Algorithms 10:487–506
Jerrum M, Sinclair A (1989) Approximate counting, uniform generation and rapidly mixing Markov chains. Inf Comput 82:93–133
Jerrum M, Valiant L, Vazirani V (1986) Random generation of combinatorial structures from a uniform distribution. Theor Comput Sci 43:169–188
Kannan R, Tetali P, Vempala S (1999) Simple Markov-chain algorithms for generating bipartite graphs and tournaments. Random Struct Algorithms 14:293–308
Lawler G, Sokal A (1988) Bounds on the L2 spectrum for Markov chains and Markov processes: a generalization of Cheeger’s inequality. Trans Am Math Soc 309:557–580
Morris B (2002) Improved bounds for sampling contingency tables. Random Struct Algorithms 21:135–146
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)
Papadimitriou CH (1994) Computational complexity. Addison-Wesley, Reading
Author information
Authors and Affiliations
Corresponding author
Additional information
N. Bhatnagar was supported by DOD ONR grant N0014-07-1-05-06 and DMS 0528488.
D. Randall was supported in part by NSF grants CCF-0830367 and DMS-0505505.
Rights and permissions
About this article
Cite this article
Bezáková, I., Bhatnagar, N. & Randall, D. On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries. J Comb Optim 22, 457–468 (2011). https://doi.org/10.1007/s10878-010-9323-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-010-9323-9