Geometry of rank tests

Proceedings of the 3rd European Workshop on Probabilistic Graphical Models, PGM 2006

Volumn , Issue , 2006, Pages 207-214

  Morton, Jason ^a   Pachter, Lior ^a   Shiu, Anne ^a   Sturmfels, Bernd ^a   Wienand, Oliver ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC PROPERTIES; EXPLORATORY ANALYSIS; GEOMETRIC PROPERTIES; GRAPHICAL MODEL; GRAPHICAL TEST; LINEAR EXTENSIONS; MINKOWSKI; NON-PARAMETRIC STATISTICS; ORDINAL DATA; PARTIALLY ORDERED SET; PERMUTOHEDRON; PROBABILISTIC CONDITIONALS; RANK TEST; RUNS TESTS; SIGN TEST; SUBMODULAR; SUBMODULAR FUNCTIONS; SUMMANDS; SYMMETRIC GROUPS;

EQUIVALENCE CLASSES;

STATISTICAL TESTS;

EID: 70449534423     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. G Brightwell and P Winkler. Counting linear extensions. Order, 8(3):225-242, 1991.
2. K Brown. Buildings. Springer, New York, 1989.
3. M Carr and S Devadoss. Coxeter complexes and graph associahedra. 2004. Available from http://arxiv.org/abs/math.QA/0407229.
4. E Gawrilow and M Joswig. Polymake: a framework for analyzing convex polytopes, in Polytopes-Combinatorics and Computation, eds. G Kalai and G M Ziegler, Birkḧauser, 2000, 43-74.
5. L Lov́asz. Submodular functions and convexity, in Math Programming: The State of the Art, eds. A Bachem, M Groetschel, and B Korte, Springer, 1983, 235-257.
6. F Matú̌s. Ascending and descending conditional independence relations, in Proceedings of the Eleventh Prague Conference on Inform. Theory, Stat. Dec. Functions and Random Proc., Academia, B, 1992, 189-200.
7. F Matú̌s. Towards classification of semigraphoids. Discrete Mathematics, 277, 115-145, 2004.
8. EJG Pitman. Significance tests which may be applied to samples from any populations. Supplement to the Journal of the Royal Statistical Society, 4(1):119-130, 1937.
9. A Postnikov. Permutohedra, associahedra, and beyond. 2005. Available from http://arxiv.org/abs/math/0507163.
10. A Postnikov, V Reiner, L Williams. Faces of Simple Generalized Permutohedra. Preprint, 2006.
11. RP Stanley. Enumerative Combinatorics Volume I, Cambridge University Press, Cambridge, 1997.
12. J Stembridge. Maple packages for symmetric functions, posets, root systems, and finite Coxeter groups. Available from www.math.lsa.umich.edu/ ∼jrs/maple.html.
13. M Studený. Probablistic conditional independence structures. Springer Series in Information Science and Statistics, Springer-Verlag, London, 2005.
14. M Studeńy, RR Bouckaert, and T Kocka. Extreme supermodular set functions over five variables. Institute of Information Theory and Automation, Research report n. 1977, Prague, 2000.
15. J Tits. Le probl̀eme des mots dans les groupes de Coxeter. Symposia Math., 1:175-185, 1968.
16. K Willbrand, F Radvanyi, JP Nadal, JP Thiery, and T Fink. Identifying genes from up-down properties of microarray expression series. Bioinformat-ics, 21(20):3859-3864, 2005.
17. G Ziegler. Lectures on polytopes. Vol. 152 of Graduate Texts in Mathematics. Springer-Verlag, 1995.