Convex Rank Tests and Semigraphoids

Details Convex Rank Tests and Semigraphoids Convex Rank Tests and Semigraphoids

2007-02-20

arxiv.org/abs/math/0702564v2

Mathematics

Combinatorics

Scientific paper

Convex rank tests are partitions of the symmetric group which have desirable geometric properties. The statistical tests defined by such partitions involve counting all permutations in the equivalence classes. Each class consists of the linear extensions of a partially ordered set specified by data. Our methods refine existing rank tests of non-parametric statistics, such as the sign test and the runs test, and are useful for exploratory analysis of ordinal data. We establish a bijection between convex rank tests and probabilistic conditional independence structures known as semigraphoids. The subclass of submodular rank tests is derived from faces of the cone of submodular functions, or from Minkowski summands of the permutohedron. We enumerate all small instances of such rank tests. Of particular interest are graphical tests, which correspond to both graphical models and to graph associahedra.

Affiliated with

Also associated with

No associations

Rating

Convex Rank Tests and Semigraphoids 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 Convex Rank Tests and Semigraphoids, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Convex Rank Tests and Semigraphoids will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-84303