论文信息 - Compressed polytopes and statistical disclosure limitation

Compressed polytopes and statistical disclosure limitation

We provide a characterization of the compressed lattice polytopes in terms of their facet defining inequalities and we show that every compressed lattice polytope is affinely isomorphic to a 0/1-polytope. As an application, we characterize those graphs whose cut polytopes are compressed and discuss consequences for studying linear programming relaxations in statistical disclosure limitation.

Seth Sullivant

[1] B. Sturmfels. Gröbner bases and convex polytopes , 1995 .

[2] Ramayya Krishnan,et al. Disclosure Detection in Multivariate Categorical Databases: Auditing Confidentiality Protection Through Two New Matrix Operators , 1999 .

[3] Paul D. Seymour,et al. Matroids and Multicommodity Flows , 1981, Eur. J. Comb..

[4] Michel Deza,et al. Geometry of cuts and metrics , 2009, Algorithms and combinatorics.

[5] Nicholas Eriksson,et al. Polyhedral conditions for the nonexistence of the MLE for hierarchical log-linear models , 2006, J. Symb. Comput..

[6] T. Hibi,et al. Convex polytopes all of whose reverse lexicographic initial ideals are squarefree , 2001 .

[7] Richard P. Stanley,et al. Decompositions of Rational Convex Polytopes , 1980 .

[8] P. Diaconis,et al. Algebraic algorithms for sampling from conditional distributions , 1998 .

[9] Ali Ridha Mahjoub,et al. On the cut polytope , 1986, Math. Program..