We study Markov bases of decomposable graphical models consisting of primitive moves (i.e., square-free moves of degree two) by determining the structure of fibers of sample size two. We show that the number of elements of fibers of sample size two are powers of two and we characterize primitive moves in Markov bases in terms of connected components of induced subgraphs of the independence graph of a hierarchical model. This allows us to derive a complete description of minimal Markov bases and minimal invariant Markov bases for decomposable models.
"Minimal and minimal invariant Markov bases of decomposable models for contingency tables." Bernoulli 16 (1) 208 - 233, February 2010. https://doi.org/10.3150/09-BEJ207