Relationship between strictly collapsible and perfect contingency tables (Q1071435)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Relationship between strictly collapsible and perfect contingency tables |
scientific article; zbMATH DE number 3940470
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Relationship between strictly collapsible and perfect contingency tables |
scientific article; zbMATH DE number 3940470 |
Statements
Relationship between strictly collapsible and perfect contingency tables (English)
0 references
1986
0 references
\textit{A. S. Whittemore} [J. R. Stat. Soc., Ser. B 40, 328-340 (1978; Zbl 0413.62041)] conjectured that an N-dimensional contingency table p is strictly collapsible over each factor with respect to the set of remaining factors if and only if p has a certain factorization. I prove this conjecture for \(N=3\) and show by counterexamples that it is false for \(N>3\).
0 references
perfect contingency tables
0 references
independence
0 references
interaction
0 references
marginalization
0 references
strictly collapsible
0 references
factorization
0 references
0.87505555
0 references
0.8620674
0 references
0.85837907
0 references
0.8474017
0 references
0.8413607
0 references
0.84107876
0 references
