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

DOI10.1111/1467-842X.00278zbMATH Open1064.62068OpenAlexW2092561912MaRDI QIDQ4665381FDOQ4665381

Satoshi Aoki, Akimichi Takemura

Publication date: 11 April 2005

Published in: Australian <html_ent glyph="@amp;" ascii="&amp;"/> New Zealand Journal of Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/1467-842x.00278

Recommendations

• Minimal invariant Markov basis for sampling contingency tables with fixed marginals
• Open problems on connectivity of fibers with positive margins in multi-dimensional contingency tables
• Some characterizations of minimal Markov basis for sampling from discrete conditional distribu\-tions
• Algebraic Markov Bases and MCMC for Two‐Way Contingency Tables
• Algebraic algorithms for sampling from conditional distributions

zbMATH Keywords

Markov chain Monte Carloconditional inference

Mathematics Subject Classification ID

Numerical analysis or methods applied to Markov chains (65C40) Contingency tables (62H17) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Cited In (49)

• Markov degree of the Birkhoff model
• Markov Bases: A 25 Year Update
• Markov chain Monte Carlo exact tests for incomplete two-way contingency tables
• Markov chain Monte Carlo tests for designed experiments
• Markov complexity of monomial curves
• Huge Unimodular $n$-Fold Programs
• Markov chain Monte Carlo test of toric homogeneous Markov chains
• Degree bounds for a minimal Markov basis for the three-state toric homogeneous Markov chain model
• The Graver complexity of integer programming
• Equivariant lattice bases
• Connecting tables by allowing negative cell counts
• A finiteness theorem for Markov bases of hierarchical models
• Ideals of adjacent minors
• \(N\)-fold integer programming
• On the Gröbner complexity of matrices
• Some characterizations of minimal Markov basis for sampling from discrete conditional distribu\-tions
• Theorems of Carathéodory, Minkowski–Weyl, and Gordan up to Symmetry
• Perturbation method for determining the group of invariance of hierarchical models
• Support sets in exponential families and oriented matroid theory
• Finite Gröbner bases in infinite dimensional polynomial rings and applications
• Algebraic Markov Bases and MCMC for Two‐Way Contingency Tables
• Markov bases and structural zeros
• Goodness of fit for log-linear network models: dynamic Markov bases using hypergraphs
• Minimal and minimal invariant Markov bases of decomposable models for contingency tables
• Distance-reducing Markov bases for sampling from a discrete sample space
• Connecting tables with zero-one entries by a subset of a Markov basis
• Indispensable monomials of toric ideals and Markov bases
• Markov bases of three-way tables are arbitrarily complicated
• Multigraded commutative algebra of graph decompositions
• Minimal invariant Markov basis for sampling contingency tables with fixed marginals
• A Markov basis for conditional test of common diagonal effect in quasi-independence model for square contingency tables
• Betti numbers of Stanley-Reisner rings determine hierarchical Markov degrees
• Markov bases for two-way subtable sum problems
• Binomial fibers and indispensable binomials
• Asymptotic behavior of Markov complexity
• Random generation of \(2 \times 2 \times\dots \times 2 \times J\) contingency tables
• Lexicographic Gröbner bases for transportation problems of format \(r\times 3\times 3\)
• \(N\)-fold integer programming and nonlinear multi-transshipment
• A divide-and-conquer algorithm for generating Markov bases of multi-way tables
• Convex integer optimization by constantly many linear counterparts
• The Markov complexity of book graphs
• \(n\)-fold integer programming in cubic time
• Conditions for swappability of records in a microdata set when some marginals are fixed
• Unboundedness of Markov complexity of monomial curves in \(\mathbb{A}^n\) for \(n \geq 4\)
• Convex integer maximization via Graver bases
• The largest group of invariance for Markov bases and toric ideals
• Fibers of multi-way contingency tables given conditionals: relation to marginals, cell bounds and Markov bases
• Huge multiway table problems
• Toric fiber products

This page was built for publication: Minimal Basis for a Connected Markov Chain over 3 x 3 x K Contingency Tables with Fixed Two-Dimensional Marginals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4665381)