A finiteness theorem for Markov bases of hierarchical models
From MaRDI portal
Publication:868884
DOI10.1016/j.jcta.2006.06.001zbMath1111.62053arXivmath/0401379OpenAlexW2018562057MaRDI QIDQ868884
Publication date: 26 February 2007
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0401379
Related Items (34)
Markov chain Monte Carlo test of toric homogeneous Markov chains ⋮ Normal Binary Hierarchical Models ⋮ Huge Unimodular $n$-Fold Programs ⋮ On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond ⋮ Bouquet algebra of toric ideals ⋮ Minimal generating sets of lattice ideals ⋮ Generalized robust toric ideals ⋮ Theorems of Carathéodory, Minkowski–Weyl, and Gordan up to Symmetry ⋮ Markov bases and generalized Lawrence liftings ⋮ Markov complexity of monomial curves ⋮ A polynomial oracle-time algorithm for convex integer minimization ⋮ The Markov complexity of book graphs ⋮ \(n\)-fold integer programming in cubic time ⋮ \(N\)-fold integer programming and nonlinear multi-transshipment ⋮ Unnamed Item ⋮ Asymptotic behavior of Markov complexity ⋮ A survey of discrete methods in (algebraic) statistics for networks ⋮ Finite Gröbner bases in infinite dimensional polynomial rings and applications ⋮ Convex integer optimization by constantly many linear counterparts ⋮ Dyck path triangulations and extendability ⋮ Unimodular binary hierarchical models ⋮ Universal Gröbner Bases of Colored Partition Identities ⋮ \(N\)-fold integer programming ⋮ Multigraded commutative algebra of graph decompositions ⋮ Exact Goodness‐of‐Fit Testing for the Ising Model ⋮ Markov bases of binary graph models of \(K_{4}\)-minor free graphs ⋮ Unboundedness of Markov complexity of monomial curves in \(\mathbb{A}^n\) for \(n \geq 4\) ⋮ On the Gröbner complexity of matrices ⋮ Convex integer maximization via Graver bases ⋮ A Kruskal-Katona type result and applications ⋮ COMBINATORIAL DEGREE BOUND FOR TORIC IDEALS OF HYPERGRAPHS ⋮ Huge multiway table problems ⋮ On the strongly robust property of toric ideals ⋮ Lower bounds on the graver complexity of \(M\)-fold matrices
Uses Software
Cites Work
- Unnamed Item
- Higher Lawrence configurations.
- Markov bases of binary graph models
- Markov bases for decomposable graphical models
- A divide-and-conquer algorithm for generating Markov bases of multi-way tables
- Algebraic algorithms for sampling from conditional distributions
- Gröbner bases and polyhedral geometry of reducible and cyclic models.
- Minimal Basis for a Connected Markov Chain over 3 x 3 x K Contingency Tables with Fixed Two-Dimensional Marginals
This page was built for publication: A finiteness theorem for Markov bases of hierarchical models
