You are here

Home » Content

Properties of semi-elementary imsets as sums of elementary imsets

Journal Name:

  • Journal of Algebraic Statistics

Publication Year:

  • 2011

Key Words:

Author NameUniversity of Author

AMS Codes:

Abstract (2. Language): 
We study properties of semi-elementary imsets and elementary imsets introduced by Studen´y [10]. 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.
Bookmark/Search this post with
FULL TEXT (PDF): 
PDF icon arastirmax-properties-semi-elementary-imsets-sums-elementary-imsets.pdf
  • 1
14-35
  • English

REFERENCES

References: 

[1] Yuguo Chen, Ian H. Dinwoodie, and Ruriko Yoshida. Markov chains, quotient ideals
and connectivity with positive margins. In Algebraic and Geometric Methods in
Statistics, pages 99–110. Cambridge Univ. Press, Cambridge, 2010.
[2] Persi Diaconis and Bernd Sturmfels. Algebraic algorithms for sampling from conditional
distributions. Ann. Statist., 26(1):363–397, 1998.
[3] Mathias Drton, Bernd Sturmfels, and Seth Sullivant. Lectures on Algebraic Statistics,
volume 39 of Oberwolfach Seminars. Birkh¨auser Verlag, Basel, 2009.
[4] Hisayuki Hara, Akimichi Takemura, and Ruriko Yoshida. On connectivity of
fibers with positive marginals in multiple logistic regression. J. Multivariate Anal.,
101(4):909–925, 2010.
[5] Raymond Hemmecke, Jason Morton, Anne Shiu, Bernd Sturmfels, and Oliver
Wienand. Three counter-examples on semi-graphoids. Combin. Probab. Comput.,
17(2):239–257, 2008.
[6] Takuya Kashimura and Akimichi Takemura. Standard imsets for undirected and
chain graphical models. arXiv:1102.2927v1, 2011.
[7] Hidefumi Ohsugi. A geometric definition of combinatorial pure subrings and Gr¨obner
bases of toric ideals of positive roots. Comment. Math. Univ. St. Pauli, 56(1):27–44,
2007.
REFERENCES 35
[8] Hidefumi Ohsugi, J¨urgen Herzog, and Takayuki Hibi. Combinatorial pure subrings.
Osaka J. Math., 37(3):745–757, 2000.
[9] Hidefumi Ohsugi and Takayuki Hibi. Non-very ample configurations arising from
contingency tables. Ann. Inst. Statist. Math., 62(4):639–644, 2010.
[10] Milan Studen´y. Probabilistic Conditional Independence Structures. Springer-Verlag,
London, 2005.
[11] Bernd Sturmfels. Grobner Bases and Convex Polytopes, volume 8 of University Lecture
Series. American Mathematical Society, Providence, RI, 1996.
[12] Ruriko Yoshida. Open problems on connectivity of fibers with positive margins in
multi-dimensional contingency tables. Journal of Algebraic Statistics, 1(1):13–26,
2010.

Thank you for copying data from http://www.arastirmax.com