Some characterizations of minimal Markov basis for sampling from discrete conditional distribu\-tions

DOI10.1007/BF02530522zbMath1049.62068MaRDI QIDQ1881002

Satoshi Aoki, Akimichi Takemura

Publication date: 27 September 2004

Published in: Annals of the Institute of Statistical Mathematics (Search for Journal in Brave)

zbMATH Keywords

Markov chain Monte Carlocontingency tablesexact tests

Mathematics Subject Classification ID

Characterization and structure theory of statistical distributions (62E10) Contingency tables (62H17) Sufficient statistics and fields (62B05)

Related Items (31)

Matroid Toric Ideals: Complete Intersection, Minors, and Minimal Systems of Generators ⋮ Minimal systems of binomial generators and the indispensable complex of a toric ideal ⋮ On pseudo symmetric monomial curves ⋮ Minimal and minimal invariant Markov bases of decomposable models for contingency tables ⋮ Generalized robust toric ideals ⋮ On free resolutions of some semigroup rings ⋮ A semigroup defining the Gröbner degeneration of a toric ideal ⋮ The Markov complexity of book graphs ⋮ Markov basis and Gröbner basis of Segre-Veronese configuration for testing independence in group-wise selections ⋮ On decomposable semigroups and applications. ⋮ Unnamed Item ⋮ Markov bases for typical block effect models of two-way contingency tables ⋮ Multicanonical MCMC for sampling rare events: an illustrative review ⋮ Minimal generators of toric ideals of graphs ⋮ A generalization of the integer linear infeasibility problem ⋮ Indispensable monomials of toric ideals and Markov bases ⋮ INDISPENSABLE BINOMIALS OF FINITE GRAPHS ⋮ Markov chain Monte Carlo exact tests for incomplete two-way contingency tables ⋮ On the generalized Scarf complex of lattice ideals ⋮ The largest group of invariance for Markov bases and toric ideals ⋮ Gluing semigroups and strongly indispensable free resolutions ⋮ Random generation of \(2 \times 2 \times\dots \times 2 \times J\) contingency tables ⋮ LIFTINGS OF A MONOMIAL CURVE ⋮ Exact test of goodness of fit for binomial distribution ⋮ Indispensable binomials in semigroup ideals ⋮ Perturbation method for determining the group of invariance of hierarchical models ⋮ Minimal invariant Markov basis for sampling contingency tables with fixed marginals ⋮ Markov bases and toric ideals for some contingency tables ⋮ Markov chain Monte Carlo tests for designed experiments ⋮ COMBINATORIAL DEGREE BOUND FOR TORIC IDEALS OF HYPERGRAPHS ⋮ Distance-reducing Markov bases for sampling from a discrete sample space

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Network Algorithm for Performing Fisher's Exact Test in r × c Contingency Tables
• The Diaconis-Sturmfels algorithm and rules of succession
• Minimal systems of generators for ideals of semigroups
• A divide-and-conquer algorithm for generating Markov bases of multi-way tables
• Algebraic algorithms for sampling from conditional distributions
• Minimal Basis for a Connected Markov Chain over 3 x 3 x K Contingency Tables with Fixed Two-Dimensional Marginals
• Performing the Exact Test of Hardy-Weinberg Proportion for Multiple Alleles
• Markov chain Monte Carlo exact tests for incomplete two-way contingency tables

This page was built for publication: Some characterizations of minimal Markov basis for sampling from discrete conditional distribu\-tions