CHARACTERIZATION OF THE MAXIMUM PROBABILITY FIXED MARGINALS r x c CONTINGENCY TABLES

* In this paper operators i[j] and [j]k are defined, whose effects on an r x c contingency table X are to subtract 1 from [x.sub.ij] and to add 1 to [x.sub.kj], respectively, so that the composition i[j]k of the two operators changes the j-th column of the contingency table without altering its tota...

Full description

Saved in:
Bibliographic Details
Published inRevstat Vol. 18; no. 1; p. 71
Main Author Requena, Francisco
Format Journal Article
LanguageEnglish
Published Instituto Nacional de Estatistica 01.01.2020
Subjects
Algorithms
Characterization
Iran
Online AccessGet full text

Cover

More Information
Summary:* In this paper operators i[j] and [j]k are defined, whose effects on an r x c contingency table X are to subtract 1 from [x.sub.ij] and to add 1 to [x.sub.kj], respectively, so that the composition i[j]k of the two operators changes the j-th column of the contingency table without altering its total. Also a loop is defined as a composition of such operators that leaves unchanged both row and column totals. This is used to characterize the r x c contingency tables of maximum probability over the fixed marginals reference set (under the hypothesis of row and column independence). Another characterization of such maximum probability tables is given using the concept of associated U tables, a U = {[u.sub.ij]} table being defined as a table such that [u.sub.ij] > 0, 1 [less than or equal to] i [less than or equal to] r and 1 [less than or equal to] j [less than or equal to] c, and for a given set of values [r.sub.h], 1 [less than or equal to] h<r, [u.sub.h+i,j] = [r.sub.h][u.sub.ij] for all j. Finally, a necessary and sufficient condition for the uniqueness of a maximum probability table in the fixed marginals reference set is provided. Key-Words: * r x c contingency table; maximum probability r x c contingency table; network algorithm; Fisher's exact test. AMS Subject Classification: * 62H05, 62H17.
ISSN:1645-6726