Abstract
A majorization ordering is defined on matrices with the same row and column sums. This ordering is used as an ordering of dependence for contingency tables. Results are derived for maximal and minimal matrices with respect to the majorization ordering. This theory can be used to maximize and minimize Schur concave functions defined over matrices, when there are row and column sum constraints; in this paper, it is applied to the algorithm of Mehta and Patel (1983) for finding the P-value of Fisher's exact test.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
