Majorization, polyhedra, and statistical testing problems (Q1379114)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Majorization, polyhedra, and statistical testing problems |
scientific article; zbMATH DE number 1116071
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Majorization, polyhedra, and statistical testing problems |
scientific article; zbMATH DE number 1116071 |
Statements
Majorization, polyhedra, and statistical testing problems (English)
0 references
25 October 1998
0 references
The author studies the faces of a polyhedral cone \(C\) associated with a ``layered'' directed graph by means of certain partitions in the graph. He relates \(C\) to weak majorization and introduces a new preorder based on \(C\). As an application he considers two different orderings which are related to the cone \(C\) and interpretes them as optimal tests for certain statistical testing problems in discrete experiments.
0 references
weak majorization
0 references
convex polyhedra
0 references
convex hull
0 references
standard simplex
0 references
partial order
0 references
face lattice of a cone
0 references
Neyman-Pearson test
0 references
power of a test
0 references
