Extreme probabilities for contingency tables under row and column independence with application to fisher's exact test
- 1 January 1988
- journal article
- research article
- Published by Taylor & Francis in Communications in Statistics - Theory and Methods
- Vol. 17 (11) , 3677-3685
- https://doi.org/10.1080/03610928808829827
Abstract
Theorerms are proved for the maxima and minima of IIRi!/IICj!/T!IIyij ! over r× c contingcncy tables Y=(yij) with row sums R1,…,Rr, column sums C1,…,Cc, and grand total T. These results are imlplemented into the network algorithm of Mehta and Patel (1983) for computing the P-value of Fisher's exact test for unordered r×c contingency tables. The decrease in the amount of computing time can be substantial when the column sums are very different.Keywords
This publication has 6 references indexed in Scilit:
- ALGORITHM 643ACM Transactions on Mathematical Software, 1986
- A hybrid algorithm for fisher's exact test in unordered rxc contingency tablesCommunications in Statistics - Theory and Methods, 1986
- An ordering of dependence for contingency tablesLinear Algebra and its Applications, 1985
- A-Optimal Incomplete Block Designs for Control-Test Treatment ComparisonsTechnometrics, 1984
- A Network Algorithm for Performing Fisher's Exact Test in r × c Contingency TablesJournal of the American Statistical Association, 1983
- A network algorithm for the exact treatment of the 2×k contingency tableCommunications in Statistics - Simulation and Computation, 1980