Sciweavers

JCT
2007

A finiteness theorem for Markov bases of hierarchical models

13 years 10 months ago
A finiteness theorem for Markov bases of hierarchical models
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.
Serkan Hosten, Seth Sullivant
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2007
Where JCT
Authors Serkan Hosten, Seth Sullivant
Comments (0)