Fibers of multi-way contingency tables given conditionals: relation to marginals, cell bounds and Markov bases

DOI10.1007/s10463-014-0471-zzbMath1440.62221arXiv1401.1397OpenAlexW2128979788MaRDI QIDQ2355167

Xiaotian Zhu, Sonja Petrović, Aleksandra B. Slavković

Publication date: 21 July 2015

Published in: Annals of the Institute of Statistical Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.1397

zbMATH Keywords

contingency tablesdirected acyclic graphsDiophantine equationsMarkov basesdisclosure limitationmarginal tablesconditional tablesoptimization for cell entries

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Contingency tables (62H17)

Related Items (4)

Obtaining cell counts for contingency tables from rounded conditional frequencies ⋮ Goodness of fit for log-linear network models: dynamic Markov bases using hypergraphs ⋮ A survey of discrete methods in (algebraic) statistics for networks ⋮ New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling

Uses Software

• R
• 4ti2
• LattE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Synthetic two-way contingency tables that preserve conditional frequencies
• Computing generating sets of lattice ideals and Markov bases of lattices
• Lectures on algebraic statistics
• Minimal invariant Markov basis for sampling contingency tables with fixed marginals
• Using the Blankinship algorithm to find the general solution of a linear diophantine equation
• Markov bases for decomposable graphical models
• Algebraic algorithms for sampling from conditional distributions
• Ancestral graph Markov models.
• Gröbner bases of lattices, corner polyhedra, and integer programming
• Relations among conditional probabilities
• Conditional specification of statistical models.
• Markov bases of three-way tables are arbitrarily complicated
• The space of compatible full conditionals is a unimodular toric variety
• Sequential importance sampling for multiway tables
• Data augmentation in multi-way contingency tables with fixed marginal totals
• Effective lattice point counting in rational convex polytopes
• An approximation algorithm for counting contingency tables
• On the number of Solutions of a Diophantine equation of Frobenius
• Bounds for cell entries in contingency tables given marginal totals and decomposable graphs
• On Systems of Linear Diophantine Equations
• Minimal Basis for a Connected Markov Chain over 3 x 3 x K Contingency Tables with Fixed Two-Dimensional Marginals
• A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
• Simple Explicit Formula for Counting Lattice Points of Polyhedra
• Discrete Multivariate Analysis Theory and Practice

This page was built for publication: Fibers of multi-way contingency tables given conditionals: relation to marginals, cell bounds and Markov bases