This chapter of the forthcoming Handbook of Graphical Models contains an
overview of basic theorems and techniques from algebraic geometry and how they
can be applied to the study of conditional independence and graphical models.
It also introduces binomial ideals and some ideas from real algebraic geometry.
When random variables are discrete or Gaussian, tools from computational
algebraic geometry can be used to understand implications between conditional
independence statements. This is accomplished by computing primary
decompositions of conditional independence ideals. As examples the chapter
presents in detail the graphical model of a four cycle and the intersection
axiom, a certain implication of conditional independence statements. Another
important problem in the area is to determine all constraints on a graphical
model, for example, equations determined by trek separation. The full set of
equality constraints can be determined by computing the model's vanishing
ideal. The chapter illustrates these techniques and ideas with examples from
the literature and provides references for further reading.Comment: 20 pages, 1 figur