Markov bases and structural zeros

  • Rapallo F
  • 3


    Mendeley users who have this article in their library.
  • 22


    Citations of this article.


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. © 2005 Elsevier Ltd. All rights reserved.

Author-supplied keywords

  • Contingency tables
  • Diaconis-Sturmfels algorithm
  • Elimination ideal
  • Log-linear models

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Fabio Rapallo

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free