Markov bases for decomposable graphical models

Abstract

In this paper 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 induce a decomposable independence graph. We give formulas that fully identify such Markov bases and show how to use these formulas to dynamically generate random moves.