Indispensable monomials of toric ideals and Markov bases

DOI10.1016/j.jsc.2007.07.012zbMath1170.13008arXivmath/0511290OpenAlexW2024331645MaRDI QIDQ932801

Satoshi Aoki, Ruriko Yoshida, Akimichi Takemura

Publication date: 11 July 2008

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0511290

zbMATH Keywords

Gröbner basesmonomialstoric idealsbinomialscontingency tablesconditional testsMarkov-chain Monte CarloMarkov bases

Mathematics Subject Classification ID

Applications of graph theory (05C90) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Contingency tables (62H17)

Related Items (14)

Minimal systems of binomial generators and the indispensable complex of a toric ideal ⋮ Minimal generating sets of lattice ideals ⋮ Minimal and minimal invariant Markov bases of decomposable models for contingency tables ⋮ Binomial fibers and indispensable binomials ⋮ On robustness and related properties on toric ideals ⋮ On decomposable semigroups and applications. ⋮ Minimal generators of toric ideals of graphs ⋮ Isolated factorizations and their applications in simplicial affine semigroups ⋮ On the generalized Scarf complex of lattice ideals ⋮ Indispensable binomials in semigroup ideals ⋮ A short history of algebraic statistics ⋮ Markov bases for two-way subtable sum problems ⋮ Markov bases and toric ideals for some contingency tables ⋮ COMBINATORIAL DEGREE BOUND FOR TORIC IDEALS OF HYPERGRAPHS

Cites Work

• Distance-reducing Markov bases for sampling from a discrete sample space
• Compressed polytopes and statistical disclosure limitation
• Minimal invariant Markov basis for sampling contingency tables with fixed marginals
• Algebraic algorithms for sampling from conditional distributions
• Some characterizations of minimal Markov basis for sampling from discrete conditional distribu\-tions
• Solving the likelihood equations
• Non-very ample configurations arising from contingency tables
• Minimal Basis for a Connected Markov Chain over 3 x 3 x K Contingency Tables with Fixed Two-Dimensional Marginals
• Testing Statistical Hypotheses
• Parametric inference for biological sequence analysis
• INDISPENSABLE BINOMIALS OF FINITE GRAPHS
• Algebraic Statistics for Computational Biology
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Indispensable monomials of toric ideals and Markov bases