Properties of semi-elementary imsets as sums of elementary imsets
From MaRDI portal
Publication:2819983
DOI10.18409/JAS.V2I1.8zbMATH Open1347.62047arXiv1105.6027OpenAlexW2963959796MaRDI QIDQ2819983FDOQ2819983
Authors: Takuya Kashimura, Tomonari Sei, Kentaro Tanaka, Akimichi Takemura 
Publication date: 13 September 2016
Published in: Journal of Algebraic Statistics (Search for Journal in Brave)
Abstract: We study properties of semi-elementary imsets and elementary imsets introduced by Studeny (2005). The rules of the semi-graphoid axiom (decomposition, weak union and contraction) for conditional independence statements can be translated into a simple identity among three semi-elementary imsets. By recursively applying the identity, any semi-elementary imset can be written as a sum of elementary imsets, which we call a representation of the semi-elementary imset. A semi-elementary imset has many representations. We study properties of the set of possible representations of a semi-elementary imset and prove that all representations are connected by relations among four elementary imsets.
Full work available at URL: https://arxiv.org/abs/1105.6027
Recommendations
- Towards classification of semigraphoids.
- DESCRIPTION OF STRUCTURES OF STOCHASTIC CONDITIONAL INDEPENDENCE BY MEANS OF FACES AND IMSETS 3rd part: examples of use and appendices1
- Conditional independence structures examined via minors
- DESCRIPTION OF STRUCTURES OF STOCHASTIC CONDITIONAL INDEPENDENCE BY MEANS OF FACES AND IMSETS 2nd part: basic theory
- Concise representations and construction algorithms for semi-graphoid independency models
This page was built for publication: Properties of semi-elementary imsets as sums of elementary imsets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2819983)
