Approximately counting integral flows and cell-bounded contingency tables

We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, generalising a result of Dyer, Kannan and Mount (1997). We apply this to approximating the number of contingency tables with prescribed cell bounds when the number of rows is constant, but the row sums, column sums and cell bounds may be arbitrary. We provide an fpras for this problem via a combination of dynamic programming and volume estimation. This generalises an algorithm of Cryan and Dyer (2002) for standard contingency tables, but the analysis here is considerably more intricate.

[1]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[2]  Martin E. Dyer,et al.  A random polynomial-time algorithm for approximating the volume of convex bodies , 1991, JACM.

[3]  Jesús A. De Loera,et al.  Counting Integer Flows in Networks , 2003, Found. Comput. Math..

[4]  Alexander I. Barvinok,et al.  A Polynomial Time Algorithm for Counting Integral Points in Polyhedra when the Dimension Is Fixed , 1993, FOCS.

[5]  Martin E. Dyer,et al.  A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant , 2002, STOC '02.

[6]  Santosh S. Vempala,et al.  Sampling lattice points , 1997, STOC '97.

[7]  Jesús A. De Loera,et al.  Algebraic unimodular counting , 2001, Math. Program..

[8]  Santosh S. Vempala,et al.  Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[9]  Santosh S. Vempala,et al.  Simulated annealing in convex bodies and an O*(n/sup 4/) volume algorithm , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[10]  Ben Morris.  Improved bounds for sampling contingency tables , 2002, Random Struct. Algorithms.

[11]  Martin E. Dyer,et al.  Rapidly mixing Markov chains for sampling contingency tables with a constant number of rows , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[12]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[13]  P. Diaconis,et al.  Rectangular Arrays with Fixed Margins , 1995 .

[14]  Leslie G. Valiant,et al.  Random Generation of Combinatorial Structures from a Uniform Distribution , 1986, Theor. Comput. Sci..

[15]  Martin E. Dyer,et al.  A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem , 1993, Combinatorics, Probability and Computing.

[16]  Martin E. Dyer,et al.  Polynomial-time counting and sampling of two-rowed contingency tables , 2000, Theor. Comput. Sci..

[17]  P. Diaconis,et al.  Algebraic algorithms for sampling from conditional distributions , 1998 .

[18]  Eric Vigoda,et al.  A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries , 2001, STOC '01.

[19]  John Mount,et al.  Fast Unimodular Counting , 2000, Combinatorics, Probability and Computing.

[20]  Eric Vigoda,et al.  A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries , 2004, JACM.

[21]  Fabio Rapallo,et al.  Markov bases and structural zeros , 2006, J. Symb. Comput..

[22]  Santosh S. Vempala,et al.  Simulated annealing in convex bodies and an O*(n4) volume algorithm , 2006, J. Comput. Syst. Sci..

[23]  P. Diaconis,et al.  Testing for independence in a two-way table , 1985 .

[24]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[25]  Martin E. Dyer,et al.  Sampling contingency tables , 1997, Random Struct. Algorithms.

[26]  Nayantara Bhatnagar,et al.  Sampling binary contingency tables with a greedy start , 2006, SODA 2006.

[27]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[28]  Satoshi Aoki,et al.  Exact methods and Markov chain Monte Carlo methods of conditional inference for contingency tables , 2004 .

[29]  J. Mount,et al.  Application of Convex Sampling to Optimization and Contingency Table Generation/Counting. , 1995 .

[30]  Lee K. Jones,et al.  On uniform generation of two-way tables with fixed margins and the conditional volume test of Diaconis and Efron , 1996 .

[31]  Vasileios Vasaitis.  Approximate Counting by Dynamic Programming , 2005 .