arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1109.0078math.STmath.ACstat.TH
收藏

无马尔可夫基的运行马尔可夫链

Running Markov chain without Markov basis

Hisayuki Hara, Satoshi Aoki, Akimichi Takemura

摘要:

由Diaconis和Sturmfels(1998)提出的马尔可夫基方法论,激发了十多年对马尔可夫基的研究。它也促使了环面理想的Grobner基计算算法的改进,例如在4ti2中实现的算法。然而,目前已知的显式形式的马尔可夫基只对一些相对简单的模型,如可分解的列联表的模型。此外,马尔可夫基计算的一般算法往往无法产生马尔可夫基,即使是中等规模的模型在一个实际的时间量。因此,到目前为止,我们不能进行精确的测试的基础上马尔可夫基础方法的许多重要的实际问题。在这篇文章中,我们建议使用格基进行精确的测试,在马尔可夫基地是未知的情况下。格基的计算比马尔可夫基的计算简单得多。通过大量的例子,我们证明了格基方法的实用性。我们还检查,它的性能是可比的马尔可夫基地的问题,马尔可夫基地是已知的。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑