Rapidly mixing Markov chains for sampling contingency tables with a constant number of rows

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2002, Pages 711-720

  Cryan, Mary ^a   Dyer, Martin ^a   Goldberg, Leslie Ann ^b   Jerrum, Mark ^c   Martin, Russell ^b  

^a UNIVERSITY OF LEEDS   (United Kingdom)

^b UNIVERSITY OF WARWICK   (United Kingdom)

^c UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

MARKOV PROCESSES; NUMBER THEORY; POLYNOMIAL APPROXIMATION; SET THEORY; TABLE LOOKUP; THEOREM PROVING; TIME DOMAIN ANALYSIS;

SAMPLING CONTINGENCY TABLES; TIME POLYNOMIAL;

COMPUTER SCIENCE;

EID: 0036957323     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (26)

1. A.I. Barvinok, A polynomial-time algorithm for counting integral points in polyhedra when the dimension is fixed. Mathematics of Operations Research, 19(4), pp. 769-779, 1994.
2. F.K.R. Chung, R. L. Graham and S.-T. Yau, On sampling with Markov chains. Random Structures & Algorithms, 9 (1-2), PP. 55-77, 1996.
3. M. Crayn and M. Dryer, A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant. Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pp. 240-249, 2002.
4. M. Cryan, M. Dyer, L.A. Goldberg, M. Jerrum and R. Martin. Rapidly mixing Markov chains for sampling contingency tables with a constant number of rows (full version). Available online from http://www.dcs.warwick.ac.uk/~leslie/papers/contingency.ps
5. J.A. De Loera and B. Sturmfels, Algebraic unimodular counting. Preprint, Department of Mathematics, University of California, Davis, 2001.
6. P. Diaconis and B. Efron, Testing for independence in a two-way table: new interpretations of the chi-square statistic (with discussion). Annals of Statistics, 13, pp. 845-913, 1995.
7. P. Diaconis and A. Gangolli, Rectangular arrays with fixed margins, in: D. Aldous, P.P. Varaiya, J. Spencer and J. M. Steele (Eds.), Discrete Probability and Algorithms, IMA Volumes on Mathematics and its Applications, 72, Springer, New York, pp. 15-41, 1995.
8. P. Diaconis and L. Saloff-Coste, Comparison theorems for reversible Markov chains. The Annals of Applied Probability, 3(3), pp. 696-730, 1993.
9. P. Diaconis and L. Saloff-Coste, Random walk on contingency tables with fixed row and column sums. Technical Report, Department of Mathematics, Harvards University, 1995.
10. P. Diaconis and D. Stroock, Geometric bounds for eigenvalues of Markov chains. The Annals of Applied Probability, 1, pp. 36-61, 1991.
11. M. Dyer and C. Greenhill, Polynomial-time counting and sampling of two-rowed contingency tables. Theoretical Computer Science, 246, pp. 265-278, 2000.
12. M. Dyer, R. Kannan and J. Mount, Sampling contingency tables. Random Structures & Algorithms, 10(4), pp. 487-506, 1997.
13. G.R. Grimmett and D.R. Stirzaker, Probability and Random Processes, Oxford University Press, Oxford, 1992.
14. V.S. Grinberg and S.V. Sevast'yanov, Value of the Steinitz constant Funktsional. Anal. i Prilozhen., 14(2), pp. 56-57, 1980.
15. D. Hernek, Random generation of 2 × n contingency tables. Random Structures & Algorithms, 13(1), pp. 71-79, 1998.
16. M. Jerrum and A. Sinclair, Markov chain Monte Carlo method: an approach to approximate counting and integration. D.S. Hochbaum (Ed.), Approximation Algorithms for NP-Hard Problems, PWS, Boston, pp. 482-520, 1997.
17. M.R. Jerrum, L.G. Valiant, and V.V. Vazirani, Random generation of combinatorial structures from a uniform distribution, Theoretical Computer Science, 43, pp. 169-188, 1986.
18. B. Morris, Improved bounds for sampling contingency tables. 3rd International Workshop on Randomization and Approximation Techniques in Computer Science, volume 1671 of Lecture Notes in Computer Science, pp. 121-129, 1999.
19. B. Morris, Random Walks in Convex Sets. PhD thesis, Department of Statistics, University of California, Berkeley, 2000.
20. B. Morris and A.J. Sinclair, Random walks on truncated cubes and sampling 0-1 knapsack solutions. Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, pp. 230-240, 1999. Full version available from http://www.cs.berkeley.edu/~sinclair/knapsack ps, June 2000.
21. J. Mount, Application of Convex Sampling to Optimization and Contingency Table Generation. PhD thesis, Technical report CMU-CS-95-152, Computer Science Department, carnegie Mellon University, 1995.
22. I. Pak, On sampling integer points in polyhedra. Preprint, Department of Mathematics, Yale University, 2000.
23. D. Randall and P. Tetali, Analyzing Glauber dynamics by comparison of Markov chains. Journal of Mathematical Physics 41(3), pp. 1598-1615, 2000.
24. A.J. Sinclair, Improved bounds for mixing rates of Markov chains and multicommodity flow. Combinatorics, Probability & Computing, 1, pp. 351-370, 1992.
25. E. Steinitz, bedingt konvergente Reihen und konvexe Systeme, J. reine angew. Math., 143, pp. 128-175, 1913.
26. E. Vigoda, Improved bounds for sampling colorings. Journal of Mathematical Physics 41(3), pp. 1555-1569, 2000.