Binomial edge ideals and conditional independence statements

From MaRDI portal
Publication:990762

DOI10.1016/J.AAM.2010.01.003zbMATH Open1196.13018arXiv0909.4717OpenAlexW2063104797MaRDI QIDQ990762FDOQ990762


Authors: Jürgen Herzog, Takayuki Hibi, Freyja Hreinsdóttir, Thomas Kahle, Johannes Rauh Edit this on Wikidata


Publication date: 1 September 2010

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Abstract: 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


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




Recommendations




Cites Work


Cited In (only showing first 100 items - show all)





This page was built for publication: Binomial edge ideals and conditional independence statements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q990762)