Markov bases of three-way tables are arbitrarily complicated
- 15 September 2005
- journal article
- Published by Elsevier BV in Journal of Symbolic Computation
- Vol. 41 (2), 173-181
- https://doi.org/10.1016/j.jsc.2005.04.010
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- The Complexity of Three-Way Statistical TablesSIAM Journal on Computing, 2004
- On properties of multi-dimensional statistical tablesJournal of Statistical Planning and Inference, 2003
- Markov Bases of Binary Graph ModelsAnnals of Combinatorics, 2003
- Markov bases for decomposable graphical modelsBernoulli, 2003
- Rapidly mixing Markov chains for sampling contingency tables with a constant number of rowsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,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
- Three-dimensional Statistical Data Security ProblemsSIAM Journal on Computing, 1994
- A Graph Theoretic Approach to Statistical Data SecuritySIAM Journal on Computing, 1988