A finiteness theorem for Markov bases of hierarchical models
- 28 February 2007
- journal article
- Published by Elsevier BV in Journal of Combinatorial Theory, Series A
- Vol. 114 (2), 311-321
- https://doi.org/10.1016/j.jcta.2006.06.001
Abstract
No abstract availableKeywords
Other Versions
This publication has 7 references indexed in Scilit:
- A Divide-and-Conquer Algorithm for Generating Markov Bases of Multi-way TablesComputational Statistics, 2004
- Markov Bases of Binary Graph ModelsAnnals of Combinatorics, 2003
- Markov bases for decomposable graphical modelsBernoulli, 2003
- Higher Lawrence configurationsJournal of Combinatorial Theory, Series A, 2003
- Minimal Basis for a Connected Markov Chain over 3 × 3 ×K Contingency Tables with Fixed Two‐Dimensional MarginalsAustralian & New Zealand Journal of Statistics, 2003
- Gröbner Bases and Polyhedral Geometry of Reducible and Cyclic ModelsJournal of Combinatorial Theory, Series A, 2002
- Algebraic algorithms for sampling from conditional distributionsThe Annals of Statistics, 1998