Title of article
Markov bases and structural zeros
Author/Authors
Fabio Rapallo، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
9
From page
164
To page
172
Abstract
In this paper we apply the elimination technique to the computation of Markov bases, paying special attention to contingency tables with structural zeros. An algebraic relationship between the Markov basis for a table with structural zeros and the corresponding complete table is proved. In order to find the relevant Markov basis, it is enough to eliminate the indeterminates associated with the structural zeros from the toric ideal for the complete table. Moreover, we use this result for the computation of Markov bases for some classical log-linear models, such as quasi-independence and quasi-symmetry, and computations in the multi-way setting are presented.
Keywords
Contingency tables , Diaconis–Sturmfels algorithm , log-linear models , Elimination ideal
Journal title
Journal of Symbolic Computation
Serial Year
2006
Journal title
Journal of Symbolic Computation
Record number
805905
Link To Document