Majorization, polyhedra, and statistical testing problems

From MaRDI portal





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.











This page was built for publication: Majorization, polyhedra, and statistical testing problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1379114)