IDEAS home Printed from
   My bibliography  Save this article

Minimal Basis for a Connected Markov Chain over 3 × 3 ×"K" Contingency Tables with Fixed Two-Dimensional Marginals


  • Satoshi Aoki
  • Akimichi Takemura


This paper considers a connected Markov chain for sampling 3 × 3 ×"K" contingency tables having fixed two-dimensional marginal totals. Such sampling arises in performing various tests of the hypothesis of no three-factor interactions. A Markov chain algorithm is a valuable tool for evaluating "P"-values, especially for sparse datasets where large-sample theory does not work well. To construct a connected Markov chain over high-dimensional contingency tables with fixed marginals, algebraic algorithms have been proposed. These algorithms involve computations in polynomial rings using Gröbner bases. However, algorithms based on Gröbner bases do not incorporate symmetry among variables and are very time-consuming when the contingency tables are large. We construct a minimal basis for a connected Markov chain over 3 × 3 ×"K" contingency tables. The minimal basis is unique. Some numerical examples illustrate the practicality of our algorithms. Copyright 2003 Australian Statistical Publishing Association Inc..

Suggested Citation

  • Satoshi Aoki & Akimichi Takemura, 2003. "Minimal Basis for a Connected Markov Chain over 3 × 3 ×"K" Contingency Tables with Fixed Two-Dimensional Marginals," Australian & New Zealand Journal of Statistics, Australian Statistical Publishing Association Inc., vol. 45(2), pages 229-249, June.
  • Handle: RePEc:bla:anzsta:v:45:y:2003:i:2:p:229-249

    Download full text from publisher

    File URL:
    File Function: link to full text
    Download Restriction: Access to full text is restricted to subscribers.

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item


    Access and download statistics


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bla:anzsta:v:45:y:2003:i:2:p:229-249. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wiley-Blackwell Digital Licensing) or (Christopher F. Baum). General contact details of provider: .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.