Mary Cryan
ABSTRACT
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.
- S. Aoki, Exact methods and Markov chain Monte Carlo methods of conditional inference for contingency tables, PhD Thesis, University of Tokyo, 2004.Google Scholar
- 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. Google ScholarDigital Library
- W. Baldoni-Silva, J. De Loera and M. Vergne, Counting integer flows in networks, 2003. Available from http://arxiv.org/abs/math/0303228.Google Scholar
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- J. De Loera and B. Sturmfels, Algebraic unimodular counting, 2001. Available from http://arxiv.org/abs/math.CO/0104286.Google Scholar
- 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.Google ScholarCross Ref
- 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.Google ScholarCross Ref
- P. Diaconis and L. Saloff-Coste, Random walk on contingency tables with fixed row and column sums, Department of Mathematics, Harvard University, 1995.Google Scholar
- P. Diaconis and B. Sturmfels, Algebraic algorithms for sampling from conditional distributions, Annals of Statistics 26, pp. 363--397, 1998.Google ScholarCross Ref
- M. Dyer, Approximate counting by dynamic programming, in Proc. 35th Annual ACM Symposium on the Theory of Computing, pp. 693--699, 2003. Google ScholarDigital Library
- M. Dyer and C. Greenhill, Polynomial-time counting and sampling of two-rowed contingency tables. Theoretical Computer Science 246, pp. 265--278, 2000. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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.Google ScholarCross Ref
- M. Dyer, R. Kannan and J. Mount, Sampling contingency tables. Random Structures & Algorithms 10, pp. 487--506, 1997. Google ScholarDigital Library
- M. Grötschel, L. Lovász and A. Schrijver, Geometric algorithms and combinatorial optimization, Springer-Verlag, 1991.Google Scholar
- 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.Google ScholarCross Ref
- 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. Google ScholarDigital Library
- M. Jerrum, L. Valiant and V. Vazirani, Random generation of combinatorial structures from a uniform distribution, Theoretical Computer Science 43, pp. 169--188, 1986. Google ScholarCross Ref
- R. Kannan and S. Vempala, Sampling lattice points, in Proc. of 29th Annual ACM Symposium on Theory of Computing, pp. 696--700, 1997. Google ScholarDigital Library
- L. Lovász and S. Vempala, Simulated annealing in convex bodies and a O*(n4) volume algorithm, in Proc. 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 650--659, 2003. Google ScholarDigital Library
- B. Morris, Improved bounds for sampling contingency tables, in Random Structures & Algorithms, 21(2), pp. 135--146, 2002. Google ScholarDigital Library
- 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.)Google Scholar
- J. Mount, Fast unimodular counting, Combinatorics, Probability and Computing 9, pp. 277--285, 2000. Google ScholarDigital Library
- F. Rapollo, Markov bases and structural zeros. Preprint, Department of Mathematics, University of Genova, 2004.Google Scholar
- A. Schrijver, Combinatorial optimization--polyhedra and efficiency, Springer-Verlag, Berlin, 2003.Google Scholar
- L. Valiant, The complexity of computing the permanent, Theoretical Computer Science 8, 189--201, 1979.Google ScholarCross Ref
Index Terms
- Approximately counting integral flows and cell-bounded contingency tables
Recommendations
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 a fully polynomial randomized approximation scheme (FPRAS) based on volume estimation if all capacities are sufficiently large, generalizing a result of ...
A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant
STOC 2002We consider the problem of counting the number of contingency tables with given row and column sums. This problem is known to be #P-complete, even when there are only two rows (Random Structures Algorithms 10(4) (1997) 487). In this paper we present the ...
Approximately Counting $H$-Colorings is $\#\mathrm{BIS}$-Hard
We consider the problem of counting $H$-colorings from an input graph $G$ to a target graph $H$. We show that if $H$ is any fixed graph without trivial components, then the problem is as hard as the well-known problem $\#\mathrm{BIS}$, which is the problem ...
Comments