The methodology of Markov basis initiated by Diaconis and Sturmfels(1998) stimulated active research on Markov bases for more than ten years. It also motivated improvements of algorithms for Grobner basis computation for toric ideals, such as those implemented in 4ti2. However at present explicit forms of Markov bases are known only for some relatively simple models, such as the decomposable models of contingency tables. Furthermore general algorithms for Markov bases computation often fail to produce Markov bases even for moderate-sized models in a practical amount of time. Hence so far we could not perform exact tests based on Markov basis methodology for many important practical problems.
In this article we propose to use lattice bases for performing exact tests, in the case where Markov bases are not known. Computation of lattice bases is much easier than that of Markov bases. With many examples we show that the approach with lattice bases is practical. We also check that its performance is comparable to Markov bases for the problems where Markov bases are known.
An introduction to computational algebraic statistics
本文介绍了马尔可夫基的基本概念,它是交换代数和统计学之间的第一个联系。马尔可夫基的概念首先由Diaconis和Sturmfels(1998)引入,用于马尔可夫链蒙特卡罗方法对列联表的条件检验问题。在这种方法中,我们利用一个连接的马尔可夫链在给定的条件样本空间估计的P值的各种条件测试的数字。马尔可夫基在这个论点中起着重要的作用,因为它保证了链的连通性,这是估计的无偏性所需要的,对于任意条件样本空间。作为另一个重要的点,马尔可夫基被刻画为多项式环的良好指定的环面理想的生成元。这种交换代数和统计之间的联系是Diaconis和Sturmfels(1998)的主要结果。在这第一篇论文之后,马尔可夫基被交换代数和统计学的许多研究人员深入研究,这产生了一个有吸引力的领域,称为计算代数统计。本文对列联表和马尔可夫基的马尔可夫链蒙特卡罗方法作了评述,并给出了一些基本的例子。文中还给出了用代数软件Macaulay 2和统计软件R.读者还可以在Aoki,Hara and Takemura(2012)中找到本文所考虑问题的理论细节以及关于马尔可夫基的结构和示例的各种结果。