Skip to main content
SpringerLink
Log in

Markov bases and subbases for bounded contingency tables

  • Published:
Annals of the Institute of Statistical Mathematics Aims and scope Submit manuscript

Abstract

In this paper we study the computation of Markov bases for contingency tables whose cell entries have an upper bound. It is known that in this case one has to compute universal Gröbner bases, and this is often infeasible also in small- and medium-sized problems. Here we focus on bounded two-way contingency tables under independence model. We show that when these bounds on cells are positive the set of basic moves of all 2 × 2 minors connects all tables with given margins. We also give some results about bounded incomplete table and we conclude with an open problem on the necessary and sufficient condition on the set of structural zeros so that the set of basic moves of all 2 × 2 minors connects all incomplete contingency tables with given positive margins.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • 4ti2 team (2008). 4ti2: A software package for algebraic, geometric and combinatorial problems on linear spaces. Available at http://www.4ti2.de.

  • Agresti A. (2002) Categorical data analysis (2nd ed.). Wiley, New Jersey

    MATH  Google Scholar 

  • Aoki S., Takemura A. (2005) Markov chain Monte Carlo exact tests for incomplete two-way contingency table. Journal of Statistical Computation and Simulation 75(10): 787–812

    Article  MATH  MathSciNet  Google Scholar 

  • Aoki S., Takemura A. (2008) The largest group of invariance for Markov bases and toric ideals. Journal of Symbolic Computation 43(5): 342–358

    MATH  MathSciNet  Google Scholar 

  • Aoki S., Takemura A. (2010) Markov chain Monte Carlo tests for designed experiments. Journal of Statistical Planning and Inference 140(3): 817–830

    Article  MATH  MathSciNet  Google Scholar 

  • Bigatti A., La Scala R., Robbiano L. (1999) Computing toric ideals. Journal of Symbolic Computation 27(4): 351–365

    Article  MATH  MathSciNet  Google Scholar 

  • Chen, Y., Dinwoodie, I., Dobra, A., Huber, M. (2005). Lattice points, contingency tables, and sampling. In Integer points in polyhedra: Geometry, number theory, algebra, optimization. Contemporary mathematics (Vol. 374, pp. 65–78). Providence: American Mathematical Society

  • Chen Y., Dinwoodie I.H., Sullivant S. (2006) Sequential importance sampling for multiway tables. The Annals of Statistics 34(1): 523–545

    Article  MATH  MathSciNet  Google Scholar 

  • Chen Y., Dinwoodie I.H., Yoshida R. (2010) Markov chains, quotient ideals and connectivity with positive margins. In: Gibilisco P., Riccomagno E., Rogantin M.P., Wynn H.P. (eds) Algebraic and geometric methods in statistics. Cambridge University Press, New York, pp 99–110

    Google Scholar 

  • CoCoATeam (2007). CoCoA: A system for doing computations in commutative algebra. Available at http://cocoa.dima.unige.it.

  • Cox D., Little J., O’Shea D. (1992) Ideals, varieties, and algorithms. Springer, New York

    MATH  Google Scholar 

  • Cryan, M., Dyer, M., Randall, D. (2005). Approximately counting integral flows and cell-bounded contingency tables. In Proceedings of the thirty-seventh annual ACM symposium on theory of computing (pp. 413–422), Baltimore, MD.

  • De Loera J., Onn S. (2005) Markov bases of three-way tables are arbitrarily complicated. Journal of Symbolic Computation 41(2): 173–181

    Article  MathSciNet  Google Scholar 

  • Diaconis P., Sturmfels B. (1998) Algebraic algorithms for sampling from conditional distributions. The Annals of Statistics 26(1): 363–397

    Article  MATH  MathSciNet  Google Scholar 

  • Greuel, G.-M., Pfister, G., Schönemann, H. (2009). Singular 3.1.0: A computer algebra system for polynomial computations. http://www.singular.uni-kl.de.

  • Hara, H., Takemura, A., Yoshida, R. (2010). On connectivity of fibers with positive marginals in multiple logistic regression. Journal of Multivariate Analysis, in press.

  • Pistone, G., Riccomagno, E., Wynn, H. P. (2001). Algebraic statistics: Computational commutative algebra in statistics. Boca Raton: Chapman and Hall/CRC.

  • Rapallo F. (2006) Markov bases and structural zeros. Journal of Symbolic Computation 41(2): 164–172

    Article  MATH  MathSciNet  Google Scholar 

  • Rapallo, F., Rogantin, M. P. (2007). Markov chains on the reference set of contingency tables with upper bounds. Metron, 65(1).

  • Shao J. (1998) Mathematical statistics. Springer, New York

    Google Scholar 

  • Sturmfels, B. (1996). Gröbner bases and convex polytopes. University lecture series (Vol. 8). Providence: American Mathematical Society.

  • Sturmfels, B. (2002). Solving systems of polynomial equations. CBMS regional conference series in mathematics (Vol. 97). Washington, DC: Conference Board of the Mathematical Sciences.

Download references

Author information

Authors and Affiliations

  1. Department DISTA, University of Eastern Piedmont, Viale Teresa Michel 11, 15121, Alessandria, Italy

    Fabio Rapallo

  2. Statistics Department, University of Kentucky, 805A Patterson Office Tower, Lexington, KY, 40506-0027, USA

    Ruriko Yoshida

Authors
  1. Fabio Rapallo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ruriko Yoshida
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ruriko Yoshida.

About this article

Cite this article

Rapallo, F., Yoshida, R. Markov bases and subbases for bounded contingency tables. Ann Inst Stat Math 62, 785–805 (2010). https://doi.org/10.1007/s10463-010-0289-2

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10463-010-0289-2

Keywords

Search

Navigation