Approximately counting integral flows and cell-bounded contingency tables

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 413-422

  Cryan, Mary ^a   Dyer, Martin ^b   Randall, Dana ^c  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b UNIVERSITY OF LEEDS   (United Kingdom)

^c Georgia Institute of Technology   (United States)

Author keywords

Approximate counting; Contingency tables; Integral flows

Indexed keywords

APPROXIMATE COUNTING; CONTINGENCY TABLES; INTEGRAL FLOWS; VOLUME ESTIMATION;

APPROXIMATION THEORY; DYNAMIC PROGRAMMING; INTEGRAL EQUATIONS; PROBLEM SOLVING;

TABLE LOOKUP;

EID: 33746376496     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060590.1060652     Document Type: Conference Paper

References (27)

1. S. Aoki, Exact methods and Markov chain Monte Carlo methods of conditional inference for contingency tables, PhD Thesis, University of Tokyo, 2004.
2. A. Barvinok, A polynomial-time algorithm for counting integral points in polyhedra when the dimension is fixed, Mathematics of Operations Research 19, pp. 769-779, 1994.
3. W. Baldoni-Silva, J. De Loera and M. Vergne, Counting integer flows in networks, 2003. Available from http://arxiv.org/abs/math/0303228.
4. M. Cryan and M. Dyer, A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant, in Journal of Computer and System Sciences, 67(2): pp. 291-310, 2003.
5. M. Cryan, M. Dyer, L. Goldberg, M. Jerrum and R. Martin, Rapidly mixing Markov chains for sampling contingency tables with a constant number of rows, in Proc. 43rd Annual IEEE Symposium on Foundations of Computer Science, pp. 711-720, 2002.
6. J. De Loera and B. Sturmfels, Algebraic unimodular counting, 2001. Available from http://arxiv.org/abs/math.CO/0104286.
7. 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.
8. P. Diaconis and A. Gangolli, Rectangular arrays with fixed margins, in Discrete probability and algorithms (D. Aldous, P. Diaconis, J. Spencer and M. Steele, eds.), IMA Volumes on Mathematics and its Applications 72, Springer-Verlag, New York, pp. 15-41, 1995.
9. P. Diaconis and L. Saloff-Coste, Random walk on contingency tables with fixed row and column sums, Department of Mathematics, Harvard University, 1995.
10. P. Diaconis and B. Sturmfels, Algebraic algorithms for sampling from conditional distributions, Annals of Statistics 26, pp. 363-397, 1998.
11. M. Dyer, Approximate counting by dynamic programming, in Proc. 35th Annual ACM Symposium on the Theory of Computing, pp. 693-699, 2003.
12. M. Dyer and C. Greenhill, Polynomial-time counting and sampling of two-rowed contingency tables. Theoretical Computer Science 246, pp. 265-278, 2000.
13. M. Dyer, A. Frieze and R. Kannan, A random polynomial time algorithm for approximating the volume of convex bodies, Journal of the ACM 38, pp. 1-17, 1991.
14. M. Dyer, A. Frieze, R. Kannan, A. Kapoor, L. Perkovic and U. Vazirani, A mildly exponential time algorithm for approximating the number of solutions to a multidimensional knapsack problem, Combinatorics, Probability and Computing 2, 271-284, 1993.
15. M. Dyer, R. Kannan and J. Mount, Sampling contingency tables. Random Structures & Algorithms 10, pp. 487-506, 1997.
16. M. Grötschel, L. Lovász and A. Schrijver, Geometric algorithms and combinatorial optimization, Springer-Verlag, 1991.
17. R. Holmes and L. Jones, On uniform generation of two-way tables with fixed margins and the conditional volume test of Diaconis and Efron, Annals of Statistics 24, pp. 64-68, 1996.
18. M. Jerrum, A. Sinclair and E. Vigoda, A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries, in Proc. 33rd Annual ACM Symposium on Theory of Computing, pp. 712-721, 2001.
19. M. Jerrum, L. Valiant and V. Vazirani, Random generation of combinatorial structures from a uniform distribution, Theoretical Computer Science 43, pp. 169-188, 1986.
20. R. Kannan and S. Vempala, Sampling lattice points, in Proc. of 29th Annual ACM Symposium on Theory of Computing, pp. 696-700, 1997.
21. 4) volume algorithm, in Proc. 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 650-659, 2003.
22. B. Morris, Improved bounds for sampling contingency tables, in Random Structures & Algorithms, 21(2), pp. 135-146, 2002.
23. J. Mount, Application of convex sampling to optimization and contingency table generation, PhD thesis, Carnegie Mellon University, 1995. (Technical Report CMU-CS-95-152, Department of Computer Science.)
24. J. Mount, Fast unimodular counting, Combinatorics, Probability and Computing 9, pp. 277-285, 2000.
25. F. Rapollo, Markov bases and structural zeros. Preprint, Department of Mathematics, University of Genova, 2004.
26. A. Schrijver, Combinatorial optimization-polyhedra and efficiency, Springer-Verlag, Berlin, 2003.
27. L. Valiant, The complexity of computing the permanent, Theoretical Computer Science 8, 189-201, 1979.