A finiteness theorem for Markov bases of hierarchical models

  • Hoşten S
  • Sullivant S
  • 2


    Mendeley users who have this article in their library.
  • 33


    Citations of this article.


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.

Author-supplied keywords

  • Contingency tables
  • Graver complexity
  • Hierarchical models
  • Markov bases

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Serkan Hoşten

  • Seth Sullivant

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free