A finiteness theorem for Markov bases of hierarchical models

Citations of this article
Mendeley users who have this article in their library.
Get full text


We show that the complexity of the Markov bases of multidimensional tables stabilizes eventually if a single table dimension is allowed to vary. In particular, if this table dimension is greater than a computable bound, the Markov bases consist of elements from Markov bases of smaller tables. We give an explicit formula for this bound in terms of Graver bases. We also compute these Markov and Graver complexities for all K × 2 × 2 × 2 tables. © 2006 Elsevier Inc. All rights reserved.




Hoşten, S., & Sullivant, S. (2007). A finiteness theorem for Markov bases of hierarchical models. Journal of Combinatorial Theory. Series A, 114(2), 311–321. https://doi.org/10.1016/j.jcta.2006.06.001

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free