A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant

Journal of Computer and System Sciences

Volumn 67, Issue 2, 2003, Pages 291-310

  Cryan, Mary ^a   Dyer, Martin ^a  

^a UNIVERSITY OF LEEDS   (United Kingdom)

Author keywords

Approximate counting; Contingency tables; Randomized algorithms

Indexed keywords

COMPUTATIONAL COMPLEXITY; MATRIX ALGEBRA; POLYNOMIAL APPROXIMATION; POLYNOMIALS; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; RANDOM PROCESSES; VECTORS;

APPROXIMATE COUNTING; CONTINGENCY TABLES; POLYNOMIAL TIME ALGORITHM; RANDOMIZED ALGORITHM;

ALGORITHMS;

EID: 0142091463     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0022-0000(03)00014-X     Document Type: Article

References (21)

1. A.I. Barvinok, A polynomial-time algorithm for counting integral points in polyhedra when the dimension is fixed, Math. Oper. Res. 19 (4) (1994) 769-779.
2. F.K.R. Chung, R.L. Graham, S.-T. Yau, On sampling with Markov chains, Random Struct. Algorithms 9 (1-2) (1996) 55-77.
3. M. Cryan, M. Dyer, L. Goldber, M. Jerrum, R. Martin, Rapidly mixing Markov chains for sampling contingency tables with a constant number of rows, Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science, Montreal, 2002, pp. 711-720.
4. P. Diaconis, B. Efron, Testing for independence in a two-way table: new interpretations of the chi-square statistic (with discussion), Ann. Statist. 13 (1995) 845-913.
5. P. Diaconis, A. Gangolli, Rectangular arrays with fixed margins, in: D. Aldous, P.P. Varaiya, J. Spencer, J.M. Steele (Eds.), Discrete Probability and Algorithms, IMA Volumes on Mathematics and its Applications, Vol. 72, Springer, New York, 1995, pp. 15-41.
6. P. Diaconis, L. Saloff-Coste, Random walk on contingency tables with fixed row and column sums, Technical Report, Department of Mathematics, Harvard University, 1995.
7. M. Dyer, A. Frieze, R. Kannan, A random polynomial-time algorithm for approximating the volume of convex bodies, J. ACM 38 (1) (1991) 1-17.
8. M. Dyer, C. Greenhill, Random walks on combinatorial objects, in: J.D. Lamb, D.A. Preece (Eds.), Surveys in Combinatorics 1999, London Mathematical Society Lecture Note Series, Vol. 267, Cambridge University press, Cambriedge, 1999, pp. 101-136.
9. M. Dyer, C. Greenhill, Polynomial-time counting and sampling of two-rowed contingency tables, Theoret. Comput. Sci. 246 (2000) 265-278.
10. M. Dyer, R. Kannan, On Barvinok's algorithm for counting lattice points in fixed dimension, Math. Oper. Res. 22 (3) (1997) 545-549.
11. M. Dyer, R. Kannan, J. Mount, Sampling contingency tables, Random Struct. Algorithms 10 (4) (1997) 487-506.
12. G. Hadley, Linear Programming, Addison-Wesley, Massachusetts, 1962, pp. 273-330.
13. D. Hernek, Random generation of 2 × n contingency tables, Random Struct. Algorithms 13 (1) (1998) 71-79.
14. M. Jerrum, A. Sinclair, Markov chain Monte Carlo method: an approach to approximate counting and integration, in: D.S. Hochbaum (Ed.), Approximation Algorithms for NP-Hard Problems, PWS, Boston, 1997, pp. 482-520.
15. M. Jerrum, L.G. Valiant, V.V. Vazirani, Random generation of combinatorial structures from a uniform distribution, Theoret. Comput. Sci. 43 (1986) 169-188.
16. 5) volume algorithm for convex bodies, Random Struct. Algorithms 11 (1) (1997) 1-50.
17. R. Karp, M. Luby, Monte-Carlo algorithms for enumeration and reliability problems, in: Proceedings of the 24th Annual ACM Symposium on Theory of Computing, ACM Press, 1983, pp. 56-64.
18. J.L. Kelley, T.P. Srinivasan, Measure and Integral, Vol. 1, Springer-Verlag Graduate Texts in Mathematics, Vol. 116, Springer, Berlin, 1988.
19. B. Morris, Improved bounds for sampling contingency tables. Third International Workshop on Randomization and Approximation Techniques in Computer Science, Lecture Notes in Computer Science, Vol. 1671, Springer, Berlin, 1999, pp. 121-129.
20. J. Mount, Application of Convex Sampling to Optimization and Contingency Table Generation, Ph.D. Thesis, Technical Report CMU-CS-95-152, Computer Science Department, Carnegie Mellon University, 1995.
21. A. Sinclair, M. Jerrum, Approximate counting, uniform generation and rapidly mixing Markov chains, Inform. Comput. 82 (1989) 93-133.