Geometry of rank tests

Simple item page
dc.creatorMorton, Jason
dc.creatorPachter, Lior
dc.creatorShiu, Anne
dc.creatorSturmfels, Bernd
dc.creatorWienand, Oliver
dc.date2006-05-07
dc.date2006-07-20
dc.date.accessioned2026-07-07T08:07:46Z
dc.date.available2026-07-07T08:07:46Z
dc.descriptionWe study 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. These permutations are the linear extensions of partially ordered sets specified by the data. Our methods refine rank tests of non-parametric statistics, such as the sign test and the runs test, and are useful for the exploratory analysis of ordinal data. Convex rank tests correspond to probabilistic conditional independence structures known as semi-graphoids. Submodular rank tests are classified by the faces of the cone of submodular functions, or by Minkowski summands of the permutohedron. We enumerate all small instances of such rank tests. Graphical tests correspond to both graphical models and to graph associahedra, and they have excellent statistical and algorithmic properties.
dc.description8 pages, 4 figures. See also http://bio.math.berkeley.edu/ranktests/. v2: Expanded proofs, revised after reviewer comments
dc.identifierhttps://arxiv.org/abs/math/0605173
dc.identifierhttp://arxiv.org/abs/math/0605173
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/131041
dc.subjectStatistics Theory
dc.subjectCombinatorics
dc.titleGeometry of rank tests
dc.typetext

Files

Collections

arXiv