Some characterizations of minimal Markov basis for sampling from discrete conditional distributions

  • Akimichi Takemura
  • Satoshi Aoki
Contingency Table

DOI: 10.1007/BF02530522

Cite this article as:
Takemura, A. & Aoki, S. Ann Inst Stat Math (2004) 56: 1. doi:10.1007/BF02530522

Abstract

In this paper we given some basic characterizations of minimal Markov basis for a connected Markov chain, which is used for performing exact tests in discrete exponential families given a sufficient statistic. We also give a necessary and sufficient condition for uniqueness of minimal Markov basis. A general algebraic algorithm for constructing a connected Markov chain was given by Diaconis and Sturmfels (1998,The Annals of Statistics,26, 363–397). Their algorithm is based on computing Gröbner basis for a certain ideal in a polynomial ring, which can be carried out by using available computer algebra packages. However structure and interpretation of Gröbner basis produced by the packages are sometimes not clear, due to the lack of symmetry and minimality in Gröbner basis computation. Our approach clarifies partially ordered structure of minimal Markov basis.

Key words and phrases

Contingency tables exact tests Markov chain Monte Carlo 

Copyright information

© The Institute of Statistical Mathematics 2004

Authors and Affiliations

  • Akimichi Takemura
    • 1
  • Satoshi Aoki
    • 1
  1. 1.Graduate School of Information Science and TechnologyUniversity of TokyoTokyoJapan

Personalised recommendations