Small Contingency Tables with Large Gaps

DOI10.1137/S0895480104444090MaRDI QIDQ5317588zbMATH OpenOpenAlexFDO

Authors Seth Sullivant

Publication date 16 September 2005

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

contingency tabledisclosure limitationGröbner basisinteger programming

Mathematics Subject Classification ID

Contingency tables (62H17) Integer programming (90C10)

Abstract: We construct examples of contingency tables on $n$ binary random variables where the gap between the linear programming lower/upper bound and the true integer lower/upper bounds on cell entries is exponentially large. These examples provide evidence that linear programming may not be an effective heuristic for detecting disclosures when releasing margins of multi-way tables.

Recommendations

• The Association of Three Attributes
• Combining Contingency Tables with Missing Dimensions
• Contingency tables with prescribed marginals
• Comparing marginal distributions of large, sparse contingency tables

Cited in

(8)

• Markov bases of three-way tables are arbitrarily complicated
• Data augmentation in multi-way contingency tables with fixed marginal totals
• Rapid mixing and Markov bases
• Disclosure control on multi-way tables by means of the shuttle algorithm: extensions and experiments
• Rapid calculation of exact cell bounds for contingency tables from conditional frequencies
• Bounds for cell entries in contingency tables given marginal totals and decomposable graphs
• Unimodular binary hierarchical models
• Integer Programming and Combinatorial Optimization

This page was built for publication: Small Contingency Tables with Large Gaps

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