Convex rank tests and semigraphoids

SIAM Journal on Discrete Mathematics

Volumn 23, Issue 3, 2009, Pages 1117-1134

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

^a STANFORD UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c Rheinland Pfälzische Technische Universität Kaiserslautern Landau   (Germany)

Author keywords

Braid arrangement; Graphical model; Permutohedron; Polyhedral fan; Rank test semigraphoid; Submodular function; Symmetric group

Indexed keywords

GRAPHICAL MODEL; PERMUTOHEDRON; RANK TEST; SUBMODULAR FUNCTIONS; SYMMETRIC GROUPS;

BINARY CODES; EQUIVALENCE CLASSES; GRAPHIC METHODS; SET THEORY; SPEECH RECOGNITION; WEAVING;

STATISTICAL TESTS;

EID: 73249149443     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/080715822     Document Type: Article

References (28)

1. L. BILLERA, I. GELFAND, AND B. STURMFELS, Duality and minors of secondary polyhedra, J. Combin. Theory Ser. B, 57 (1993), pp. 258-268.
2. G. BRIGHTWELL AND P. WINKLER, Counting linear extensions, Order, 8 (1991), pp. 225-242.
3. F. BROWN, T. FINK, AND K. WILLBRAND, On arithmetic and asymptotic proper-ties of up-down numbers, Discrete Math., 307 (2007), pp. 1722-1736.
4. K. BROWN, Buildings, Springer, New York, 1989.
5. M. CARR AND S. DEVADOSS, Coxeter complexes and graph associahedra, Topology Appl., 153 (2006), pp. 2155-2168.
6. W. COOK AND L. SEIFORD, The geometry of rank-order tests, Amer. Statist., 37 (1983), pp. 307-311.
7. A. DAWID, Conditional independence in statistical theory, J. Roy. Statist. Soc. Ser. B, 41 (1979), pp. 1-31.
8. M. DRTON AND T. RICHARDSON, Binary models for marginal independence, J.Roy.Statist.Soc. Ser. B, 70 (2008), pp. 287-309.
9. M. DRTON, B. STURMFELS, AND S. SuLLIVANT, Lectures on Algebraic Statistics, Oberwolfach Seminars, Vol. 40, Birkauser, Basel 2009.
10. E. GAWRILOW AND M. JOSWIG, Polymake: A framework for analyzing convex polytopes, in Polytopes - Combinatorics and Computation, G. Kalai and G. M. Ziegler, eds., Birkhäuser, Basel, 2000, pp. 43-74.
11. R. HEMMECKE, J. MORTON, A. SHIU, B. STURMFELS, AND O. WIENAND, Three counterexamples on semigraphoids, Combin. Probab. Comput., 17 (2008), pp. 239-257.
12. F. MATÚŠ, 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), pp. 189-200.
13. F. MATÚŠ, On equivalence of Markov properties over undirected graphs, J. Appl. Probab., 29 (1992), pp. 745-749.
14. F. MAT́Š, Towards classification of semigraphoids, Discrete Math., 277 (2004), pp. 115-145.
15. J. MORTON, A. SHIU, L. PACHTER, AND B. STURMFELS, The cyclohedron test for finding periodic genes in time course expression studies, Stat. Appl. Genet. Mol. Biol., 6 (2007), pp. 1-21.
16. J. PEARL, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, Morgan Kaufman, San Mateo, CA, 1988.
17. E. J. G. PITMAN, Significance tests which may be applied to samples from any populations, supplement to J. Roy. Statist. Soc., 4 (1937), pp. 119-130.
18. A. POSTNIKOV, Permutohedra, Associahedra, and Beyond, International Mathematics Research Notices, 2005, pp. 1026-1106.
19. A. POSTNIKOV, V. REINER, AND L. WILLIAMS, Faces of generalized permutohedra, Doc. Math., 13 (2008), pp. 207-273.
20. R. P. STANLEY, Enumerative Combinatorics, Vol. I, Cambridge University, London, 1997.
21. J. STEMBRIDGE, Maple Packages for Symmetric Functions, Posets, Root Systems, and Finite Coxeter Groups, www.math.lsa.umich.edu/- jrs/maple.html.
22. M. STUDENÝ, Conditional independence relations have no finite completeness characterization, Kybernetika (Prague), 25 (1990), pp. 72-79.
23. M. STUDENÝ, RR. BOUCKAERT, AND T. KOCKA, Extreme Supermodular Set Functions Over Five Variables, Research report 1977, Institute of In formation Theory and Automation, Prague, 2000.
24. M. STUDENÝ, Probabilistic Conditional Independence Structures, Springer Ser. Inform. Sci. Stat., Springer, London, 2005.
25. J. TITS, Le problème des mots dans les groupes de Coxeter, Symposia Math., 1 (1968), pp. 175-185.
26. D. WEINREICH, The rank ordering of genotypic fitness values predicts genetic constraint on natural selection on landscapes lacking sign epistasis, Genetics, 171 (2005), pp. 1397-1405.
27. K. WILLBRAND, F. RADVANYI, J. P. NADAL, J P. THIERY, AND T. FINK, Identifying genes from up-down properties of microarray expression series, B ioinform., 21 (2005), pp. 3859-3864.
28. G. ZIEGLER, Lectures on Polytopes, Grad. Texts in Math. 152, Springer, New York, 1995.