Abstract
In this chapter we provide an algorithm for performing exact tests with a lattice basis, even in the case where Markov bases are not known. As mentioned in Sect. 15, computation of lattice bases is much easier than that of Markov bases. With many examples we show that the approach with lattice bases is practical. We also check that its performance is comparable to Markov bases for the problems where Markov bases are known. This chapter is based on Hara et al. (Proceedings of the Second CREST-SBM International Conference, “Harmony of Gröbner Bases and the Modern Industrial Society”. World Scientfic, Singapore, 2012. To appear).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Chen, Y., Diaconis, P., Holmes, S.P., Liu, J.S.: Sequential Monte Carlo methods for statistical analysis of tables. J. Amer. Statist. Assoc. 100(469), 109–120 (2005)
Chen, Y., Dinwoodie, I., Dobra, A., Huber, M.: Lattice points, contingency tables, and sampling. In: Integer Points in Polyhedra—Geometry, Number Theory, Algebra, Optimization, Contemp. Math., vol. 374, pp. 65–78. Amer. Math. Soc., Providence, RI (2005)
Chen, Y., Dinwoodie, I., Sullivant, S.: Sequential importance sampling for multiway tables. Ann. Statist. 34(1), 523–545 (2006)
Chen, Y., Small, D.: Exact tests for the Rasch model via sequential importance sampling. Psychometrika 70, 11–30 (2005)
Dobra, A.: Dynamic Markov bases. J. Comput. Graph. Stat. 21(2), 496–517 (2012)
Hara, H., Aoki, S., Takemura, A.: Running Markov chain without Markov basis. In: Hibi, T. (ed.) Proceedings of the Second CREST-SBM International Conference, Harmony of Gröbner Bases and the Modern Industrial Society. World Scientfic, Singapore, 45–62 (2012)
Hara, H., Takemura, A., Yoshida, R.: On connectivity of fibers with positive marginals in multiple logistic regression. J. Multivariate Anal. 101, 909–925 (2010)
Miller, E., Sturmfels, B.: Combinatorial Commutative Algebra. In: Graduate Texts in Mathematics, vol. 227. Springer, New York (2005)
Santos, F., Sturmfels, B.: Higher Lawrence configurations. J. Combin. Theory Ser. A 103(1), 151–164 (2003)
Schrijver, A.: Theory of Linear and Integer Programming. In: Wiley-Interscience Series in Discrete Mathematics. Wiley, Chichester (1986).
Sturmfels, B.: Gröbner Bases and Convex Polytopes. In: University Lecture Series, vol. 8. American Mathematical Society, Providence, RI (1996)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer Science+Business Media New York
About this chapter
Cite this chapter
Aoki, S., Hara, H., Takemura, A. (2012). Running Markov Chain Without Markov Bases. In: Markov Bases in Algebraic Statistics. Springer Series in Statistics, vol 199. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-3719-2_16
Download citation
DOI: https://doi.org/10.1007/978-1-4614-3719-2_16
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-3718-5
Online ISBN: 978-1-4614-3719-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)