Binomial edge ideals and conditional independence statements

Details Binomial edge ideals and conditional independence statements Binomial edge ideals and conditional independence statements

2009-09-25

arxiv.org/abs/0909.4717v2

Mathematics

Commutative Algebra

Scientific paper

We introduce binomial edge ideals attached to a simple graph $G$ and study their algebraic properties. We characterize those graphs for which the quadratic generators form a Gr\"obner basis in a lexicographic order induced by a vertex labeling. Such graphs are chordal and claw-free. We give a reduced squarefree Gr\"obner basis for general $G$. It follows that all binomial edge ideals are radical ideals. Their minimal primes can be characterized by particular subsets of the vertices of $G$. We provide sufficient conditions for Cohen--Macaulayness for closed and nonclosed graphs. Binomial edge ideals arise naturally in the study of conditional independence ideals. Our 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. In this case the primary decomposition has a natural statistical interpretation

Affiliated with

Also associated with

No associations

Rating

Binomial edge ideals and conditional independence statements does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Binomial edge ideals and conditional independence statements, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Binomial edge ideals and conditional independence statements will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-326247