Markov chain Monte Carlo methods for the regular two-level fractional factorial designs and cut ideals

Abstract

It is known that a Markov basis of the binary graph model of a graph $G$ corresponds to a set of binomial generators of cut ideals $I_{\hat{G}}$ of the suspension $\hat{G}$ of $G$. In this paper, we give another application of cut ideals to statistics. We show that a set of binomial generators of cut ideals is a Markov basis of some regular two-level fractional factorial design. As application, we give a Markov basis of degree 2 for designs defined by at most two relations.

24 pages. arXiv admin note: text overlap with arXiv:1302.2408

References in corpus (1)

• Markov chain Monte Carlo tests for designed experiments