A finiteness theorem for Markov bases of hierarchical models

Simple item page
dc.creatorHosten, Serkan
dc.creatorSullivant, Seth
dc.date2004-01-27
dc.date2008-04-18
dc.date.accessioned2026-07-07T09:33:14Z
dc.date.available2026-07-07T09:33:14Z
dc.descriptionWe 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.
dc.description13 pages, 1 figure
dc.identifierhttps://arxiv.org/abs/math/0401379
dc.identifierhttp://arxiv.org/abs/math/0401379
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/159063
dc.subjectCombinatorics
dc.subjectStatistics Theory
dc.titleA finiteness theorem for Markov bases of hierarchical models
dc.typetext

Files

Collections

arXiv