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 beyond a computable bound, the Markov bases consist of elements of 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.
منابع مشابه
Se p 20 02 HIGHER LAWRENCE CONFIGURATIONS
Any configuration of lattice vectors gives rise to a hierarchy of higher-dimensional configurations which generalize the Lawrence construction in geometric combinatorics. We prove finiteness results for the Markov bases, Graver bases and face posets of these configurations, and we discuss applications to the statistical theory of log-linear models.
متن کاملMarkov bases of decomposable models for contingency tables
We study Markov bases of hierarchical models in general and those of decomposable models in particular for multiway contingency tables by determining the structure of fibers of sample size two. We prove that the number of elements of fibers of sample size two are powers of two and we characterize the primitive moves (i.e. square-free moves of degree two) of Markov bases in terms of connected co...
متن کاملSome Results on Baer's Theorem
Baer has shown that, for a group G, finiteness of G=Zi(G) implies finiteness of ɣi+1(G). In this paper we will show that the converse is true provided that G=Zi(G) is finitely generated. In particular, when G is a finite nilpotent group we show that |G=Zi(G)| divides |ɣi+1(G)|d′ i(G), where d′i(G) =(d( G /Zi(G)))i.
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS Fibers of sample size two of hierarchical models and Markov bases of decomposable models for contingency tables
We study Markov bases of hierarchical models in general and those of decomposable models in particular for multiway contingency tables by determining the structure of fibers of sample size two. We prove that the number of elements of fibers of sample size two are powers of two and we characterizes the primitive moves of Markov bases in terms of connected components of a certain graph defined fr...
متن کاملHigher Lawrence configurations
Any configuration of lattice vectors gives rise to a hierarchy of higher-dimensional configurations which generalize the Lawrence construction in geometric combinatorics. We prove finiteness results for the Markov bases, Graver bases and facet posets of these configurations, and we discuss applications to the statistical theory of log-linear models.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 114 شماره
صفحات -
تاریخ انتشار 2007