arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0401379math.COmath.STstat.TH

A finiteness theorem for Markov bases of hierarchical models

Serkan Hosten, Seth Sullivant

英文摘要:

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 \times 2 \times 2 \times 2 $ tables.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑