Markov bases and subbases for bounded contingency tables

Annals of the Institute of Statistical Mathematics

Volumn 62, Issue 4, 2010, Pages 785-805

  Rapallo, Fabio ^a   Yoshida, Ruriko ^b  

^a UNIVERSITY OF EASTERN PIEDMONT   (Italy)

^b NONE

Author keywords

Markov basis; Structural zeros; Universal gr bner basis

Indexed keywords

CONTINGENCY TABLE; INCOMPLETE TABLE; MARKOV BASIS; OPEN PROBLEMS; STRUCTURAL ZEROS; SUFFICIENT CONDITIONS; UPPER BOUND;

EID: 77958044841     PISSN: 00203157     EISSN: 15729052     Source Type: Journal    
DOI: 10.1007/s10463-010-0289-2     Document Type: Conference Paper

References (22)

1. 4ti2 team (2008). 4ti2: A software package for algebraic, geometric and combinatorial problems on linear spaces. Available at http://www.4ti2.de.
2. Agresti, A. (2002). Categorical data analysis (2nd ed.). New Jersey: Wiley.
3. 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.
4. Aoki, S., Takemura, A. (2008). The largest group of invariance for Markov bases and toric ideals. Journal of Symbolic Computation, 43(5), 342-358.
5. Aoki, S., Takemura, A. (2010). Markov chain Monte Carlo tests for designed experiments. Journal of Statistical Planning and Inference, 140(3), 817-830.
6. Bigatti, A., La Scala, R., Robbiano, L. (1999). Computing toric ideals. Journal of Symbolic Computation, 27(4), 351-365.
7. 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
8. Chen, Y., Dinwoodie, I. H., Sullivant, S. (2006). Sequential importance sampling for multiway tables. The Annals of Statistics, 34(1), 523-545.
9. Chen, Y., Dinwoodie, I. H., Yoshida, R. (2010). Markov chains, quotient ideals and connectivity with positive margins. In P. Gibilisco, E. Riccomagno, M. P. Rogantin, H. P. Wynn (Eds.), Algebraic and geometric methods in statistics (pp. 99-110). New York: Cambridge University Press.
10. CoCoATeam (2007). CoCoA: A system for doing computations in commutative algebra. Available at http://cocoa.dima.unige.it.
11. Cox, D., Little, J., O'Shea, D. (1992). Ideals, varieties, and algorithms. New York: Springer.
12. 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.
13. De Loera, J., Onn, S. (2005). Markov bases of three-way tables are arbitrarily complicated. Journal of Symbolic Computation, 41(2), 173-181.
14. Diaconis, P., Sturmfels, B. (1998). Algebraic algorithms for sampling from conditional distributions. The Annals of Statistics, 26(1), 363-397.
15. 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.
16. Hara, H., Takemura, A., Yoshida, R. (2010). On connectivity of fibers with positive marginals in multiple logistic regression. Journal of Multivariate Analysis, in press.
17. Pistone, G., Riccomagno, E.,Wynn, H. P. (2001). Algebraic statistics: Computational commutative algebra in statistics. Boca Raton: Chapman and Hall/CRC.
18. Rapallo, F. (2006). Markov bases and structural zeros. Journal of Symbolic Computation, 41(2), 164-172.
19. Rapallo, F., Rogantin, M. P. (2007). Markov chains on the reference set of contingency tables with upper bounds. Metron, 65(1).
20. Shao, J. (1998). Mathematical statistics. New York: Springer.
21. Sturmfels, B. (1996). Gröbner bases and convex polytopes. University lecture series (Vol. 8). Providence: American Mathematical Society.
22. Sturmfels, B. (2002). Solving systems of polynomial equations. CBMS regional conference series in mathematics (Vol. 97). Washington, DC: Conference Board of the Mathematical Sciences