Computational methods in Markov chains (60J22) Generalized linear models (logistic models) (62J12) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Random walks on graphs (05C81) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25) Lattice points in specified regions (11P21)
Abstract: We study random walks on contingency tables with fixed marginals, corresponding to a (log-linear) hierarchical model. If the set of allowed moves is not a Markov basis, then there exist tables with the same marginals that are not connected. We study linear conditions on the values of the marginals that ensure that all tables in a given fiber are connected. We show that many graphical models have the positive margins property, which says that all fibers with strictly positive marginals are connected by the quadratic moves that correspond to conditional independence statements. The property persists under natural operations such as gluing along cliques, but we also construct examples of graphical models not enjoying this property. We also provide a negative answer to a question of Engstr"om, Kahle, and Sullivant by demonstrating that the global Markov ideal of the complete bipartite graph K_(3,3) is not radical. Our analysis of the positive margins property depends on computing the primary decomposition of the associated conditional independence ideal. The main technical results of the paper are primary decompositions of the conditional independence ideals of graphical models of the -cycle and the complete bipartite graph , with various restrictions on the size of the nodes.
Recommendations
- Markov bases for decomposable graphical models
- Open problems on connectivity of fibers with positive margins in multi-dimensional contingency tables
- Minimal and minimal invariant Markov bases of decomposable models for contingency tables
- Markov bases and toric ideals for some contingency tables
- Markov bases of binary graph models
Cites work
- scientific article; zbMATH DE number 3513115 (Why is no real title available?)
- scientific article; zbMATH DE number 1232919 (Why is no real title available?)
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 1182838 (Why is no real title available?)
- scientific article; zbMATH DE number 1560247 (Why is no real title available?)
- scientific article; zbMATH DE number 3443668 (Why is no real title available?)
- scientific article; zbMATH DE number 1827070 (Why is no real title available?)
- Algebraic algorithms for sampling from conditional distributions
- Binomial edge ideals and conditional independence statements
- Binomial ideals
- Decompositions of commutative monoid congruences and binomial ideals.
- Generalized binomial edge ideals
- Gröbner bases of toric varieties
- Lectures on algebraic statistics
- Markov bases of binary graph models
- Markov bases of three-way tables are arbitrarily complicated
- Minimal primes of ideals arising from conditional independence statements
- Multigraded commutative algebra of graph decompositions
- On the toric algebra of graphical models
- Polyhedra: a package for computations with convex polyhedral objects
- Sequential importance sampling for multiway tables
- Toric fiber products
Cited in
(9)- Multigraded commutative algebra of graph decompositions
- Rapid mixing and Markov bases
- Neighborliness of marginal polytopes
- Parity binomial edge ideals
- Detecting binomiality
- Lifting Markov bases and higher codimension toric fiber products
- The geometry of Gaussian double Markovian distributions
- From Polynomial Invariants to Linear Loops
- Markov Bases: A 25 Year Update
This page was built for publication: Positive margins and primary decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405381)
