Markov bases for decomposable graphical models

We show that primitive data swaps or moves are the only moves that have to be included in a Markov basis that links all the contingency tables having a set of fixed marginals when this set of marginals induces a decomposable independence graph. We give formulae that fully identify such Markov bases and show how to use these formulae to dynamically generate random moves.

[1]  S. Haberman,et al.  The analysis of frequency data , 1974 .

[2]  Stephen E. Fienberg,et al.  Discrete Multivariate Analysis: Theory and Practice , 1976 .

[3]  T. Speed,et al.  Markov Fields and Log-Linear Interaction Models for Contingency Tables , 1980 .

[4]  S. Reiss,et al.  Data-swapping: A technique for disclosure control , 1982 .

[5]  P. Diaconis,et al.  Testing for independence in a two-way table , 1985 .

[6]  James M. Dickey,et al.  Discussion: Testing for Independence in a Two-Way Table: New Interpretations of the Chi-Square Statistic , 1985 .

[7]  Milan Vlach,et al.  Conditions for the existence of solutions of the three-dimensional planar transportation problem , 1986, Discret. Appl. Math..

[8]  J. N. R. Jeffers,et al.  Graphical Models in Applied Multivariate Statistics. , 1990 .

[9]  A. Agresti.  [A Survey of Exact Inference for Contingency Tables]: Rejoinder , 1992 .

[10]  B. Peyton,et al.  An Introduction to Chordal Graphs and Clique Trees , 1993 .

[11]  C R Mehta,et al.  The exact analysis of contingency tables in medical research , 1994, Statistical methods in medical research.

[12]  B. Sturmfels.  Gröbner bases and convex polytopes , 1995 .

[13]  J. York,et al.  Bayesian Graphical Models for Discrete Data , 1995 .

[14]  P. Diaconis,et al.  Rectangular Arrays with Fixed Margins , 1995 .

[15]  David A. Cox,et al.  Ideals, Varieties, and Algorithms , 1997 .

[16]  Stephen E. Fienberg,et al.  Disclosure limitation using perturbation and related methods for categorical data , 1998 .

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

[18]  Ian H. Dinwoodie,et al.  The Diaconis-Sturmfels algorithm and rules of succession , 1998 .

[19]  Michael I. Jordan.  Graphical Models , 2003 .

[20]  S E Fienberg,et al.  INAUGURAL ARTICLE by a Recently Elected Academy Member:Bounds for cell entries in contingency tables given marginal totals and decomposable graphs , 2000 .

[21]  L. Willenborg,et al.  Elements of Statistical Disclosure Control , 2000 .

[22]  A. Dobra.  Statistical tools for disclosure limitation in multi-way contingency tables , 2002 .

[23]  Seth Sullivant,et al.  A Divide-and-Conquer Algorithm for Generating Markov Bases of Multi-way Tables , 2004, Comput. Stat..