# Conditional independence ideals with hidden variables

@article{Clarke2020ConditionalII,
title={Conditional independence ideals with hidden variables},
author={Oliver Clarke and Fatemeh Mohammadi and Johannes Rauh},
year={2020},
volume={117},
pages={102029}
}
• Published 10 January 2019
• Mathematics, Computer Science
We study a class of determinantal ideals that are related to conditional independence (CI) statements with hidden variables. Such CI statements correspond to determinantal conditions on a matrix whose entries are probabilities of events involving the observed random variables. We focus on an example that generalizes the CI ideals of the intersection axiom. In this example, the minimal primes are again determinantal ideals, which is not true in general.
3 Citations

## Figures and Topics from this paper

Matroid stratifications of hypergraph varieties, their realization spaces, and discrete conditional independence models
• Mathematics
• 2021
We study conditional independence (CI) models in statistical theory, in the case of discrete random variables, from the point of view of algebraic geometry and matroid theory. Any CI model with
On the primary decomposition of some determinantal hyperedge ideal
• Computer Science, Mathematics
J. Symb. Comput.
• 2021
The method is based on the algorithm for primary decomposition by Gianni, Trager and Zacharias, but it was not able to decompose the ideal using the standard form of that algorithm, nor by any other method known to us.
Conditional probabilities via line arrangements and point configurations
• Mathematics
• 2020
We study the connection between probability distributions satisfying certain conditional independence (CI) constraints, and point and line arrangements in incidence geometry. To a family of CI

## References

SHOWING 1-10 OF 50 REFERENCES
Minimal primes of ideals arising from conditional independence statements
• Mathematics
• 2011
Abstract We study ideals whose primary decomposition specifies the relevant structural zeros of certain conditional independence models. The ideals we study generalize the class of ideals considered
Binomial edge ideals and conditional independence statements
• Mathematics, Computer Science
• 2010
It follows that all binomial edge ideals are radical ideals, and the results apply for the class of conditional independence ideals where a fixed binary variable is independent of a collection of other variables, given the remaining ones.
The binomial ideal of the intersection axiom for conditional probabilities
The binomial ideal associated with the intersection axiom of conditional probability is shown to be radical and is expressed as an intersection of toric prime ideals. This solves a problem in
Generalized binomial edge ideals
• J. Rauh
• Mathematics, Computer Science
• 2013
A class of binomial ideals associated to graphs with finite vertex sets that generalize the binomial edge ideals, and they arise in the study of conditional independence ideals, are studied.
On the primary decomposition of some determinantal hyperedge ideal
• Computer Science, Mathematics
J. Symb. Comput.
• 2021
The method is based on the algorithm for primary decomposition by Gianni, Trager and Zacharias, but it was not able to decompose the ideal using the standard form of that algorithm, nor by any other method known to us.
Prime splittings of determinantal ideals
• Mathematics
• 2012
ABSTRACT We consider determinantal ideals, where the generating minors are encoded in a hypergraph. We study when the generating minors form a Gröbner basis. In this case, the ideal is radical, and
Probabilistic conditional independence structures
• M. Studený
• Mathematics, Computer Science
Information science and statistics
• 2005
The author has been careful to use suitable terminology, and presents the work so that it will be understood by both statisticians, and by researchers in artificial intelligence.
Determinantal Facet Ideals
• Mathematics
• 2011
We consider ideals generated by general sets of $m$-minors of an $m\times n$-matrix of indeterminates. The generators are identified with the facets of an $(m-1)$-dimensional pure simplicial complex.
SOLVING SYSTEMS OF POLYNOMIAL EQUATIONS
Polynomials in one variable Grobner bases of zero-dimensional ideals Bernstein's theorem and fewnomials Resultants Primary decomposition Polynomial systems in economics Sums of squares Polynomial
Information-theoretic inference of common ancestors
• Mathematics, Computer Science
Entropy
• 2015
This work proves an information-theoretic inequality that allows for the inference of common ancestors of observed parts in any DAG representing some unknown larger system and shows that a large amount of dependence in terms of mutual information among the observations implies the existence of a common ancestor that distributes this information.