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

Annals of the Institute of Statistical Mathematics

Volumn 56, Issue 1, 2004, Pages 1-17

  Takemura, Akimichi ^a   Aoki, Satoshi ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

Contingency tables; Exact tests; Markov chain Monte Carlo

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; INFORMATION SCIENCE; MATHEMATICAL MODELS; MONTE CARLO METHODS; POLYNOMIALS;

CONTINGENCY TABLES; EXACT TESTS; HARDY-WEINBERG MODEL; MARKOV CHAIN MONTE CARLO;

MARKOV PROCESSES;

EID: 3142641116     PISSN: 00203157     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02530522     Document Type: Article

References (16)

1. Aoki, S. (2002). Improving path trimming in a network algorithm for Fisher's exact test in two-way contingency tables, Journal of Statistical Computation and Simulation, 72, 205-216.
2. Aoki, S. (2003). Network algorithm for the exact test of Hardy-Weinberg proportion for multiple alleles, Biometrical Journal, 45, 471-490.
3. Aoki, S. and Takemura, A. (2002). Markov chain Monte Carlo exact tests for incomplete two-way contingency tables, Tech. Report, METR 02-08, Department of Mathematical Engineering and Information Physics, The University of Tokyo (submitted for publication).
4. Aoki, S. and Takemura, A. (2003). Minimal basis for connected Markov chain over 3 × 3 × K contingency tables with fixed two-dimensional marginals, Australian and New Zealand Journal of Statistics, 45, 229-249.
5. Bishop, Y. M. M., Fienberg, S. E. and Holland, P. W. (1975). Discrete Multivariate Analysis: Theory and Practice, The MIT Press, Cambridge, Massachusetts.
6. Briales, E., Campillo, A., Marijuán, C. and Pisón, P. (1998). Minimal systems of generators for ideals of semigroups, Journal of Pure and Applied Algebra, 124, 7-30.
7. Diaconis, P. and Sturmfels, B. (1998). Algebraic algorithms for sampling from conditional distributions, The Annals of Statistics, 26, 363-397.
8. Diaconis, P., Eisenbud, D. and Sturmfels, B. (1998). Lattice walks and primary decomposition, Mathematical Essays in Honor of Gian-Carlo Rota (eds. B. E. Sagan and R. P. Stanley), 173-193, Birkhauser, Boston.
9. Dinwoodie, J. H. (1998). The Diaconis-Sturmfels algorithm and rules of succession, Bernoulli, 4, 401-410.
10. Dobra, A. and Sullivant, S. (2002). A divide-and-conquer algorithm for generating Markov bases of multi-way tables, National Institute of Statistical Sciences Tech. Report, No. 124 (available from http://www.niss.org/ downloadabletechreports.html).
11. Guo, S. W. and Thompson, E. A. (1992). Performing the exact test of Hardy-Weinberg proportion for multiple alleles, Biometrika, 48, 361-372.
12. Lauritzen, S. L. (1996). Graphical Models, Oxford University Press, Oxford.
13. Mehta, C. R. and Patel, N. R. (1983). A network algorithm for performing Fisher's exact test in r × c contingency tables, Journal of the American Statistical Association, 78, 427-434.
14. Sakata, T. and Sawae, R. (2000). Echelon form and conditional test for three way contingency tables, Proceedings of the 10-th Japan and Korea Joint Conference of Statistics, 333-338.
15. Schrijver, A. (1986). Theory of Linear and Integer Programming, Wiley, Chichester.
16. Wilson, R. J. (1985). Introduction to Graph Theory, 3rd ed., Longman, New York.