Positive margins and primary decomposition

DOI10.1216/JCA-2014-6-2-173zbMATH Open1375.13047arXiv1201.2591OpenAlexW3102976302WikidataQ57442342 ScholiaQ57442342MaRDI QIDQ405381FDOQ405381

Authors: Thomas Kahle, Johannes Rauh, Seth Sullivant 

Publication date: 5 September 2014

Published in: Journal of Commutative Algebra (Search for Journal in Brave)

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 $N$-cycle and the complete bipartite graph $K_{(}2,N-2)$, with various restrictions on the size of the nodes.

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

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

zbMATH Keywords

algebraic statisticsMarkov basisbinomial primary decompositionconnectivity of fibers

Mathematics Subject Classification ID

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)

Cites Work

• Decompositions of binomial ideals
• Polyhedra: a package for computations with convex polyhedral objects
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the toric algebra of graphical models
• Lectures on algebraic statistics
• Sequential importance sampling for multiway tables
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Binomial ideals
• Algebraic algorithms for sampling from conditional distributions
• Gröbner bases of toric varieties
• Toric fiber products
• Markov bases of three-way tables are arbitrarily complicated
• Title not available (Why is that?)
• Markov bases of binary graph models
• Generalized binomial edge ideals
• Multigraded commutative algebra of graph decompositions
• Minimal primes of ideals arising from conditional independence statements
• Title not available (Why is that?)
• Decompositions of commutative monoid congruences and binomial ideals.
• Binomial edge ideals and conditional independence statements

Cited In (9)

• The geometry of Gaussian double Markovian distributions
• Markov Bases: A 25 Year Update
• Neighborliness of marginal polytopes
• Rapid mixing and Markov bases
• Parity binomial edge ideals
• Detecting binomiality
• Multigraded commutative algebra of graph decompositions
• From Polynomial Invariants to Linear Loops
• Lifting Markov bases and higher codimension toric fiber products

Uses Software

• Macaulay2
• 4ti2
• Binomials.m2
• Polyhedra
• GraphBinomials
• GitHub

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)