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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3876377 (Why is no real title available?)
- scientific article; zbMATH DE number 3984308 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 705150 (Why is no real title available?)
- scientific article; zbMATH DE number 3804333 (Why is no real title available?)
- Inequalities: theory of majorization and its applications
- Majorizations and inequalities in matrix theory
- Order-preserving functions; applications to majorization and order statistics
- Polyhedra and optimization in connection with a weak majorization ordering
- The doubly stochastic matrices of a vector majorization
- Weak k-majorization and polyhedra
Cited in
(4)
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)