Polynomial-time counting and sampling of two-rowed contingency tables

Theoretical Computer Science

Volumn 246, Issue 1-2, 2000, Pages 265-278

  Dyer, Martin ^a   Greenhill, Catherine ^a  

^a UNIVERSITY OF LEEDS   (United Kingdom)

Author keywords

Complexity; Contigency tables; Markov chains; Path coupling; Randomized algorithms

Indexed keywords

EID: 0000542530     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00136-X     Document Type: Article

References (20)

1. J.H. Albert, A.K. Gupta, Estimation in contingency tables using prior information, J. Roy. Statist. Soc. Ser. B (Methodological) 45 (1) (1983) 60-69.
2. D. Aldous, Random walks on finite groups and rapidly mixing Markov chains, in: A. Dold, B. Eckmann (Eds.), Séminaire de Probabilités XVII 1981/1982, Lecture Notes in Mathematics, Vol. 986, Springer, New York, 1983, pp. 243-297.
3. R. Barlow, Statistics, Wiley, Chichester, 1989.
4. R. Bubley, M. Dyer, Path coupling: A technique for proving rapid mixing in Markov chains, 38th Annual Symp. on Foundations of Computer Science, IEEE, San Alimitos, 1997, pp. 223-231.
5. R. Bubley, M. Dyer, C. Greenhill, Beating the 2Δ bound for approximately counting colourings: A computer-assisted proof of rapid mixing, in 9th Annual Symp. on Discrete Algorithms, ACM-SIAM, New York-Philadelphia, 1998, pp. 355-363.
6. F.R.K. Chung, R.L. Graham, S.T. Yau, On sampling with Markov chains, Random Struct. Algorithms 9 (1996) 55-77.
7. P. Diaconis, B. Effron, Testing for independence in a two-way table: new interpretations of the chi-square statistic (with discussion), Ann. Statist. 13 (1985) 845-913.
8. 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.
9. P. Diaconis, L. Saloff-Coste, Random walk on contingency tables with fixed row and column sums, Tech. Report, Department of Mathematics, Harvard University, 1995.
10. M. Dyer, A. Frieze, Computing the volume of convex bodies: A case where randomness provably helps, Proc. Symp. in Applied Mathematics, Vol. 44, 1991, pp. 123-169.
11. M. Dyer, C. Greenhill, A genuinely polynomial time algorithm for sampling two-rowed contingency tables, 25th Internat. Colloq. on Automata, Languages and Programming, Aalborg, Denmark, 1998, pp. 339-350.
12. M. Dyer, C. Greenhill, A more rapidly mixing Markov chain for graph colourings, Random Struct. Algorithms 13 (1998) 285-317.
13. M. Dyer, R. Kannan, J. Mount, Sampling contingency tables, Random Struct. Algorithms 10 (1997) 487-506.
14. D. Hernek, Private Communication, 1998.
15. D. Hernek, Random generation of 2 x n contingency tables, Random Struct. Algorithms 13 (1998) 71-79.
16. M. Jerrum, A. Sinclair, The Markov chain Monte Carlo method: an approach to approximate counting and integration, in: D. Hochbaum (Ed.), Approximation Algorithms for NP-Hard Problems, PWS Publishing, Boston, 1996, pp. 482-520.
17. R. Kannan, P. Tetali, S. Vempala, Simple Markov chain algorithms for generating bipartite graphs and tournaments, 8th Annual Symp. on Discrete Algorithms, ACM-SIAM, New York-Philadelphia, 1997, pp. 193-200.
18. R.M. Karp, M. Luby, Monte-Carlo algorithms for enumeration and reliability problems, 24th Annual Symp. on Foundations of Computer Science, IEEE, San Alimitos, 1983, pp. 56-64.
19. R. Motwani, P. Raghavan, Randomized Algorithms, Cambridge University Press, Cambridge, 1995.
20. J.N.K. Rao, A.J. Scott, The analysis of categorical data from complex sample surveys: chi-squared tests for goodness of fit and independence in two-way tables, J. Amer. Statist. Assoc. 76 (374) (1981) 221-230.