A Divide-and-Conquer Algorithm for Generating Markov Bases of Multi-way Tables
- 1 September 2004
- journal article
- research article
- Published by Springer Science and Business Media LLC in Computational Statistics
- Vol. 19 (3), 347-366
- https://doi.org/10.1007/bf03372101
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Gröbner Bases and Polyhedral Geometry of Reducible and Cyclic ModelsJournal of Combinatorial Theory, Series A, 2002
- Bounds for cell entries in contingency tables given marginal totals and decomposable graphsProceedings of the National Academy of Sciences, 2000
- The Diaconis-Sturmfels Algorithm and Rules of SuccessionBernoulli, 1998
- Algebraic algorithms for sampling from conditional distributionsThe Annals of Statistics, 1998
- Rectangular Arrays with Fixed MarginsPublished by Springer Science and Business Media LLC ,1995
- Optimal decomposition by clique separatorsDiscrete Mathematics, 1993
- An Introduction to Chordal Graphs and Clique TreesThe IMA Volumes in Mathematics and its Applications, 1993
- Ideals, Varieties, and AlgorithmsUndergraduate Texts in Mathematics, 1992
- Testing for Independence in a Two-Way Table: New Interpretations of the Chi-Square StatisticThe Annals of Statistics, 1985
- Data-swapping: A technique for disclosure controlJournal of Statistical Planning and Inference, 1982