Upper and lower bounds on cell counts in cross-classifications of nonnegative counts play important roles in a number of practical problems, inclusing statistical disclosure limitation, computer tomography, mass transportation, cell suppression, and data swapping. Some features of the Frechet bounds are well known, intuitive, and regularly used by those working on disclosure limitation methods, especially those for two-dimensional tables. We previously have described a series of results relating these bounds to theory on loglinear models for cross-classified counts. This paper provides the actual theory and proofs for the special case of decomposable loglinear models and their related independence graphs. It also includes an extension linked to the structure of reducible graphs and a discussion of the relevance of other results linked to nongraphical loglinear models.

%B Proceedings of the National Academy of Sciences of the United States of America %V 97 %P 11885-11892 %G eng