This paper considers contingency tables in which the marginal frequencies for one variable are all I. This could occur with two-category binary data or when a continuous variable is treated in categorical fashion. Some results concerning the expectation of goodneea-of-fit statistics are reported. In
Sampling contingency tables
β Scribed by Martin Dyer; Ravi Kannan; John Mount
- Publisher
- John Wiley and Sons
- Year
- 1997
- Tongue
- English
- Weight
- 231 KB
- Volume
- 10
- Category
- Article
- ISSN
- 1042-9832
No coin nor oath required. For personal study only.
β¦ Synopsis
We give polynomial time algorithms for random sampling from a set of contingency tables, which is the set of m = n matrices with given row and column sums, provided the row and column sums are sufficiently large with respect to m, n. We use this to approximately count the number of such matrices. These problems are of interest in Statistics and Combinatorics.
π SIMILAR VOLUMES
If only the marginal counts of a contingency table are known, inference regarding a statistic e.g. like the log odds ratio is still possible. In the following a 2\*2 contingency table and the log odds ratio as the interesting statistic are assumed, although the methodology is more general. Given the
Let r s r , r and c s c , . . . , c be positive integer partitions of N. Let βΊ denote the set of all 2 = n arrays of nonnegative integers whose ith row sums to r and jth i column sums to c . We consider the problem of randomly generating an element from the j uniform distribution over βΊ . This prob
**Praise for the First Edition** "This is a superb text from which to teach categorical data analysis, at a variety of levels. . . [t]his book can be very highly recommended." β*Short Book Reviews* "Of great interest to potential readers is the variety of fields that are represented in the examp