A divide-and-conquer algorithm for generating Markov bases of multi-way tables

DOI10.1007/BF03372101zbMath1063.62085MaRDI QIDQ1775965

Adrian Dobra, Seth Sullivant

Publication date: 20 May 2005

Published in: Computational Statistics (Search for Journal in Brave)

zbMATH Keywords

Gröbner basescontingency tablesexact distributiondecomposable graphical modelsMarkov basesdisclosure limitation

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Applications of graph theory (05C90) Contingency tables (62H17)

Related Items

Power analysis of independence testing for three-way contingency tables of small sizes, Some characterizations of minimal Markov basis for sampling from discrete conditional distribu\-tions, Goodness of fit for log-linear network models: dynamic Markov bases using hypergraphs, A finiteness theorem for Markov bases of hierarchical models, Minimal and minimal invariant Markov bases of decomposable models for contingency tables, Hierarchical subspace models for contingency tables, Markov bases for typical block effect models of two-way contingency tables, A survey of discrete methods in (algebraic) statistics for networks, Toric fiber products, Multigraded commutative algebra of graph decompositions, A Markov basis for conditional test of common diagonal effect in quasi-independence model for square contingency tables, Conditions for swappability of records in a microdata set when some marginals are fixed, Hybrid schemes for exact conditional inference in discrete exponential families, Perturbation method for determining the group of invariance of hierarchical models, Gaussian graphical models with toric vanishing ideals, Markov bases for two-way subtable sum problems, COMBINATORIAL DEGREE BOUND FOR TORIC IDEALS OF HYPERGRAPHS, Gröbner bases and polyhedral geometry of reducible and cyclic models.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decomposition by clique separators
• Testing for independence in a two-way table: New interpretations of the chi-square statistic
• Conditions for the existence of solutions of the three-dimensional planar transportation problem
• Data-swapping: A technique for disclosure control
• The Diaconis-Sturmfels algorithm and rules of succession
• Algebraic unimodular counting
• Markov bases for decomposable graphical models
• Elements of statistical disclosure control
• A survey of exact inference for contingency tables. With comments and a rejoinder by the author
• Algebraic algorithms for sampling from conditional distributions
• Gröbner bases and polyhedral geometry of reducible and cyclic models.
• Optimal decomposition by clique separators
• Bounds for cell entries in contingency tables given marginal totals and decomposable graphs
• Bayesian Graphical Models for Discrete Data