Markov bases of three-way tables are arbitrarily complicated

DOI10.1016/j.jsc.2005.04.010zbMath1120.62043OpenAlexW2004380822MaRDI QIDQ2457324

Shmuel Onn, Jesús A. De Loera

Publication date: 23 October 2007

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2005.04.010

zbMATH Keywords

Markov basesContingency tablestransportation polytopesconfidentiality of statistical datasampling and random generationstatistical data security

Mathematics Subject Classification ID

Foundations and philosophical topics in statistics (62A01) Contingency tables (62H17)

Related Items (24)

Power analysis of independence testing for three-way contingency tables of small sizes ⋮ Betti numbers of Stanley-Reisner rings determine hierarchical Markov degrees ⋮ Markov bases and subbases for bounded contingency tables ⋮ Three centuries of categorical data analysis: Log-linear models and maximum likelihood estima\-tion ⋮ Exact inference in contingency tables via stochastic approximation Monte Carlo ⋮ Stochastic approximation Monte Carlo importance sampling for approximating exact conditional probabilities ⋮ Positive margins and primary decomposition ⋮ \(N\)-fold integer programming and nonlinear multi-transshipment ⋮ Asymptotic behavior of Markov complexity ⋮ A survey of discrete methods in (algebraic) statistics for networks ⋮ The Graver complexity of integer programming ⋮ \(N\)-fold integer programming ⋮ Hypergraph encodings of arbitrary toric ideals ⋮ The largest group of invariance for Markov bases and toric ideals ⋮ Support sets in exponential families and oriented matroid theory ⋮ Sequential importance sampling for multiway tables ⋮ Exact test of goodness of fit for binomial distribution ⋮ Hybrid schemes for exact conditional inference in discrete exponential families ⋮ Unboundedness of Markov complexity of monomial curves in \(\mathbb{A}^n\) for \(n \geq 4\) ⋮ Convex integer maximization via Graver bases ⋮ Rapid Mixing and Markov Bases ⋮ Graphs of transportation polytopes ⋮ COMBINATORIAL DEGREE BOUND FOR TORIC IDEALS OF HYPERGRAPHS ⋮ Fibers of multi-way contingency tables given conditionals: relation to marginals, cell bounds and Markov bases

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Network Algorithm for Performing Fisher's Exact Test in r × c Contingency Tables
• Higher Lawrence configurations.
• On properties of multi-dimensional statistical tables
• Markov bases for decomposable graphical models
• Algebraic algorithms for sampling from conditional distributions
• Gröbner bases and polyhedral geometry of reducible and cyclic models.
• Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows
• A Graph Theoretic Approach to Statistical Data Security
• Three-dimensional Statistical Data Security Problems
• The Complexity of Three-Way Statistical Tables
• Minimal Basis for a Connected Markov Chain over 3 x 3 x K Contingency Tables with Fixed Two-Dimensional Marginals
• Integer Programming and Combinatorial Optimization

This page was built for publication: Markov bases of three-way tables are arbitrarily complicated