Markov bases and subbases for bounded contingency tables

DOI10.1007/S10463-010-0289-2zbMATH Open1440.62220arXiv0905.4841OpenAlexW2018962646MaRDI QIDQ2634809FDOQ2634809

Authors: Fabio Rapallo, Ruriko Yoshida 

Publication date: 19 February 2016

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

Abstract: In this paper we study the computation of Markov bases for contingency tables whose cell entries have an upper bound. In general a Markov basis for unbounded contingency table under a certain model differs from a Markov basis for bounded tables. Rapallo, (2007) applied Lawrence lifting to compute a Markov basis for contingency tables whose cell entries are bounded. However, in the process, one has to compute the universal Gr"obner basis of the ideal associated with the design matrix for a model which is, in general, larger than any reduced Gr"obner basis. Thus, this is also infeasible in small- and medium-sized problems. In this paper we focus on bounded two-way contingency tables under independence model and show that if these bounds on cells are positive, i.e., they are not structural zeros, the set of basic moves of all $2imes2$ minors connects all tables with given margins. We end this paper with an open problem that if we know the given margins are positive, we want to find the necessary and sufficient condition on the set of structural zeros so that the set of basic moves of all $2imes2$ minors connects all incomplete contingency tables with given margins.

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

Recommendations

• Markov bases for two-way subtable sum problems
• Minimal and minimal invariant Markov bases of decomposable models for contingency tables
• Markov chains on the reference set of contingency tables with upper bounds
• Markov bases of conditional independence models for permutations
• Markov bases and toric ideals for some contingency tables
• Markov bases of binary graph models
• Connecting tables with zero-one entries by a subset of a Markov basis
• Markov bases for typical block effect models of two-way contingency tables
• A divide-and-conquer algorithm for generating Markov bases of multi-way tables
• Minimal invariant Markov basis for sampling contingency tables with fixed marginals

zbMATH Keywords

Markov basisstructural zeros[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=universal+Gr%EF%BF%BD%EF%BF%BDbner+basis&go=Go universal Gr��bner basis]

Mathematics Subject Classification ID

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

Cites Work

• SINGULAR
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sequential importance sampling for multiway tables
• Algebraic algorithms for sampling from conditional distributions
• Computing toric ideals
• Markov chain Monte Carlo tests for designed experiments
• Markov bases and structural zeros
• Markov chains on the reference set of contingency tables with upper bounds
• Markov bases of three-way tables are arbitrarily complicated
• Markov chain Monte Carlo exact tests for incomplete two-way contingency tables
• The largest group of invariance for Markov bases and toric ideals
• Title not available (Why is that?)
• Approximately counting integral flows and cell-bounded contingency tables
• On connectivity of fibers with positive marginals in multiple logistic regression

Cited In (19)

• Markov chains on the reference set of contingency tables with upper bounds
• Exact Goodness‐of‐Fit Testing for the Ising Model
• Exact inference in contingency tables via stochastic approximation Monte Carlo
• Conditional inference given partial information in contingency tables using Markov bases
• Markov Bases: A 25 Year Update
• A characterization of saturated designs for factorial experiments
• Connecting tables by allowing negative cell counts
• A finiteness theorem for Markov bases of hierarchical models
• Blow-up algebras, determinantal ideals, and Dedekind-Mertens-like formulas
• Contingency tables of network type: models, Markov basis and applications
• Goodness of fit for log-linear network models: dynamic Markov bases using hypergraphs
• Minimal and minimal invariant Markov bases of decomposable models for contingency tables
• Connecting tables with zero-one entries by a subset of a Markov basis
• Markov bases of three-way tables are arbitrarily complicated
• Minimal invariant Markov basis for sampling contingency tables with fixed marginals
• Markov bases for two-way subtable sum problems
• Markov bases and toric ideals for some contingency tables
• Counting subsets of contingency tables
• Fibers of multi-way contingency tables given conditionals: relation to marginals, cell bounds and Markov bases

Uses Software

• CoCoA
• SINGULAR
• 4ti2

This page was built for publication: Markov bases and subbases for bounded contingency tables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2634809)