Gröbner bases and polyhedral geometry of reducible and cyclic models.
DOI10.1006/JCTA.2002.3301zbMATH Open1044.62065OpenAlexW1990576250MaRDI QIDQ1865397FDOQ1865397
Authors: Serkan Hoşten, Seth Sullivant 
Publication date: 26 March 2003
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcta.2002.3301
Recommendations
Contingency tables (62H17) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55)
Cites Work
- Title not available (Why is that?)
- On the toric algebra of graphical models
- Lectures on Polytopes
- Title not available (Why is that?)
- Algebraic algorithms for sampling from conditional distributions
- The Complexity of Three-Way Statistical Tables
- Title not available (Why is that?)
- Title not available (Why is that?)
- A divide-and-conquer algorithm for generating Markov bases of multi-way tables
- Primary decomposition of lattice basis ideals
- Conditions for the existence of solutions of the three-dimensional planar transportation problem
Cited In (28)
- Factorized mutual information maximization
- A finiteness theorem for Markov bases of hierarchical models
- The maximum likelihood degree of toric varieties
- Ideals of adjacent minors
- Mixture decompositions of exponential families using a decomposition of their sample spaces
- Higher Lawrence configurations.
- Gröbner bases of nested configurations
- On the toric algebra of graphical models
- Normal binary graph models
- Computing the integer programming gap
- Optimal nonparametric testing of missing completely at random and its connections to compatibility
- Minimal and minimal invariant Markov bases of decomposable models for contingency tables
- Nonlinear algebra and applications
- Generalized cut polytopes for binary hierarchical models
- Markov bases of three-way tables are arbitrarily complicated
- Multigraded commutative algebra of graph decompositions
- Gaussian graphical models with toric vanishing ideals
- A Markov basis for conditional test of common diagonal effect in quasi-independence model for square contingency tables
- Markov bases for two-way subtable sum problems
- A divide-and-conquer algorithm for generating Markov bases of multi-way tables
- Bayes factors and the geometry of discrete hierarchical loglinear models
- Hierarchical Models, Marginal Polytopes, and Linear Codes
- Game theory of undirected graphical models
- Unimodular binary hierarchical models
- Toric and Non-toric Bayesian Networks
- Ideals of graph homomorphisms
- Title not available (Why is that?)
- Toric fiber products
This page was built for publication: Gröbner bases and polyhedral geometry of reducible and cyclic models.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1865397)
