Small contingency tables with large gaps
最优化与控制
2007-06-13 v1 交换代数
统计理论
统计理论
摘要
We construct examples of contingency tables on 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.
引用
@article{arxiv.math/0405038,
title = {Small contingency tables with large gaps},
author = {Seth Sullivant},
journal= {arXiv preprint arXiv:math/0405038},
year = {2007}
}
备注
6 pages