Minimal Basis for a Connected Markov Chain over 3 x 3 x K Contingency Tables with Fixed Two-Dimensional Marginals
From MaRDI portal
Publication:4665381
DOI10.1111/1467-842X.00278zbMath1064.62068OpenAlexW2092561912MaRDI QIDQ4665381
Satoshi Aoki, Akimichi Takemura
Publication date: 11 April 2005
Published in: Australian <html_ent glyph="@amp;" ascii="&"/> New Zealand Journal of Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/1467-842x.00278
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Numerical analysis or methods applied to Markov chains (65C40) Contingency tables (62H17)
Related Items (42)
Markov chain Monte Carlo test of toric homogeneous Markov chains ⋮ Some characterizations of minimal Markov basis for sampling from discrete conditional distribu\-tions ⋮ Ideals of adjacent minors ⋮ Betti numbers of Stanley-Reisner rings determine hierarchical Markov degrees ⋮ Huge Unimodular $n$-Fold Programs ⋮ Goodness of fit for log-linear network models: dynamic Markov bases using hypergraphs ⋮ A finiteness theorem for Markov bases of hierarchical models ⋮ Minimal and minimal invariant Markov bases of decomposable models for contingency tables ⋮ Theorems of Carathéodory, Minkowski–Weyl, and Gordan up to Symmetry ⋮ Markov degree of the Birkhoff model ⋮ Markov complexity of monomial curves ⋮ The Markov complexity of book graphs ⋮ Binomial fibers and indispensable binomials ⋮ \(n\)-fold integer programming in cubic time ⋮ \(N\)-fold integer programming and nonlinear multi-transshipment ⋮ Asymptotic behavior of Markov complexity ⋮ Finite Gröbner bases in infinite dimensional polynomial rings and applications ⋮ Convex integer optimization by constantly many linear counterparts ⋮ The Graver complexity of integer programming ⋮ Indispensable monomials of toric ideals and Markov bases ⋮ Markov bases and structural zeros ⋮ Markov bases of three-way tables are arbitrarily complicated ⋮ Lexicographic Gröbner bases for transportation problems of format \(r\times 3\times 3\) ⋮ Toric fiber products ⋮ Markov chain Monte Carlo exact tests for incomplete two-way contingency tables ⋮ \(N\)-fold integer programming ⋮ Multigraded commutative algebra of graph decompositions ⋮ A Markov basis for conditional test of common diagonal effect in quasi-independence model for square contingency tables ⋮ The largest group of invariance for Markov bases and toric ideals ⋮ Support sets in exponential families and oriented matroid theory ⋮ Random generation of \(2 \times 2 \times\dots \times 2 \times J\) contingency tables ⋮ Conditions for swappability of records in a microdata set when some marginals are fixed ⋮ Perturbation method for determining the group of invariance of hierarchical models ⋮ Unboundedness of Markov complexity of monomial curves in \(\mathbb{A}^n\) for \(n \geq 4\) ⋮ Markov bases for two-way subtable sum problems ⋮ On the Gröbner complexity of matrices ⋮ Convex integer maximization via Graver bases ⋮ Minimal invariant Markov basis for sampling contingency tables with fixed marginals ⋮ Markov chain Monte Carlo tests for designed experiments ⋮ Huge multiway table problems ⋮ Fibers of multi-way contingency tables given conditionals: relation to marginals, cell bounds and Markov bases ⋮ Distance-reducing Markov bases for sampling from a discrete sample space
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
