Convex Rank Tests and Semigraphoids

@article{Morton2009ConvexRT,
  title={Convex Rank Tests and Semigraphoids},
  author={J. Morton and L. Pachter and Anne Shiu and B. Sturmfels and Oliver Wienand},
  journal={SIAM J. Discret. Math.},
  year={2009},
  volume={23},
  pages={1117-1134}
}
  • J. Morton, L. Pachter, +2 authors Oliver Wienand
  • Published 2009
  • Mathematics, Computer Science
  • SIAM J. Discret. Math.
  • 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 nonparametric statistics, such as the sign test and the runs test, and are useful for exploratory analysis of ordinal data. We establish a bijection between… CONTINUE READING
    Statistical ranking and combinatorial Hodge theory
    220
    Generalized Permutohedra from Probabilistic Graphical Models
    10
    Counting Linear Extensions: Parameterizations by Treewidth
    9
    Geometry of Generalized Permutohedra
    5
    Coarsening polyhedral complexes
    Counting Linear Extensions of Sparse Posets
    16
    Minkowski Decomposition of Associahedra and Related Combinatorics
    6
    "Building" exact confidence nets
    2

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 51 REFERENCES
    Extreme Supermodular Set Functions Over Five Variables
    22
    The Geometry of Rank-Order Tests
    6
    Towards classification of semigraphoids
    14
    Three Counterexamples on Semigraphoids
    10
    Permutohedra, Associahedra, and Beyond
    360
    Faces of Generalized Permutohedra
    225
    Counting linear extensions
    235
    Submodular functions and convexity
    824
    Coxeter Complexes and Graph-Associahedra
    152