An Implicitization Challenge for Binary Factor Analysis

Details An Implicitization Challenge for Binary Factor Analysis An Implicitization Challenge for Binary Factor Analysis

2010-06-07

arxiv.org/abs/1006.1384v1

J. Symbolic Comput. 45 (2010), no. 12, 1296--1315

Mathematics

Algebraic Geometry

25 pages, 5 figures, presented at Mega 09 (Barcelona, Spain)

Scientific paper

We use tropical geometry to compute the multidegree and Newton polytope of the hypersurface of a statistical model with two hidden and four observed binary random variables, solving an open question stated by Drton, Sturmfels and Sullivant in "Lectures on Algebraic Statistics" (Problem 7.7). The model is obtained from the undirected graphical model of the complete bipartite graph $K_{2,4}$ by marginalizing two of the six binary random variables. We present algorithms for computing the Newton polytope of its defining equation by parallel walks along the polytope and its normal fan. In this way we compute vertices of the polytope. Finally, we also compute and certify its facets by studying tangent cones of the polytope at the symmetry classes vertices. The Newton polytope has 17214912 vertices in 44938 symmetry classes and 70646 facets in 246 symmetry classes.

Affiliated with

Also associated with

No associations

Rating

An Implicitization Challenge for Binary Factor Analysis 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 An Implicitization Challenge for Binary Factor Analysis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Implicitization Challenge for Binary Factor Analysis will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-29132