You are here

Markov bases for two-way change-point models of ladder determinantal tables

Journal Name:

Publication Year:

Abstract (2. Language): 
To evaluate the goodness-of- t of a statistical model to given data, calculating a conditional p value by a Markov chain Monte Carlo method is one of the e ective approaches. For this purpose, a Markov basis plays an important role because it guarantees the connectivity of the chain, which is needed for unbiasedness of the estimation, and therefore is investigated in various settings such as incomplete tables or subtable sum constraints. In this paper, we consider the two-way change-point model for the ladder determinantal table, which is an extension of these two previous works, i.e., works on incomplete tables by Aoki and Takemura (2005, J. Stat. Comput. Simulat.) and subtable some constraints by Hara, Takemura and Yoshida (2010, J. Pure Appl. Algebra). Our main result is based on the theory of Grobner basis for the distributive lattice. We give a numerical example for actual data.
56
73

JEL Codes:

REFERENCES

References: 

[1] Alan Agresti. A survey of exact inference for contingency tables. Statistical Science,
7:131{177, 1992.
[2] Satoshi Aoki, Hisayuki Hara, and Akimichi Takemura. Markov bases in algebraic
statistics. Springer Series in Statistics., New York, 2012.
[3] Satoshi Aoki and Akimichi Takemura. Markov chain monte carlo exact tests for
incomplete two-way contingency tables. J. Stat. Comput. Simulat., 75:787{812, 2005.
[4] Annetta Aramova, Jurgen Herzog, and Takayuki Hibi. Finite lattices and lexicographic
grobner bases. Europ. J. Combin., 21:431{439, 2000.
[5] Yvonne M.M. Bishop, Stephen E. Fienberg, and Paul W. Holland. Discrete multivariate
analysis, Theory and applications. The MIT Press, Cambridge, Massachusetts,
1975.
[6] Enrico Carlini and Fabio Rapallo. A class of statistical models to weaken independence
in two-way contingency tables. Metrika, 73:1{22, 2011.
[7] Persi Diaconis and Bernd Sturmfels. Algebraic algorithms for sampling from conditional
distributions. Annals of Statistics, 26:363{397, 1998.
[8] Adrian Dobra. Markov bases for decomposable graphical models. Bernoulli, 9:1093{
1108, 2003.
[9] Hisayuki Hara, Akimichi Takemura, and Ruriko Yoshida. Markov bases for subtable
sum problems. J. Pure Appl. Algebra, 213:1507{1521, 2010.
[10] Wilfred Keith Hastings. Monte carlo sampling methods using markov chains and
their applications. Biometrika, 57:97{109, 1970.
[11] Takayuki Hibi. Distributive lattices, ane semigroup rings and algebras with straightening
laws. In M. Nagata and H. Matsumura, editors, Commutative Algebra and
Combinatorics., volume 11, pages 93{109. Advanced Studies in Pure Math., North{
Holland, Amsterdam, 1987.
[12] Takayuki (Ed.) Hibi. Grobner Bases: Statistics and Software Systems. Springer,
2013.
[13] Chihiro Hirotsu. Two-way change-point model and its application. Austral. J. Statist.,
39:205{218, 1997.
[14] Hidefumi Ohsugi and Takayuki Hibi. Two way subtable sum problems and quadratic
grobner bases. Proc. Amer. Math. Soc., 137:1539{1542, 2009.
[15] Giovanni Pistone, Eva Riccomagno, and Henry Wynn. Algebraic statistics: Computational
commutative algebra in statistics. Chapman & Hall Ltd, Boca Raton, 2001.
REFERENCES 73
[16] Bernd Sturmfels. Grobner bases and convex polytopes. University Lecture Series, 8,
American Mathematical Society, Providence, RI., 1996.

Thank you for copying data from http://www.arastirmax.com