Random generation of 2×n contingency tables
✍ Scribed by Diane Hernek
- Publisher
- John Wiley and Sons
- Year
- 1998
- Tongue
- English
- Weight
- 163 KB
- Volume
- 13
- Category
- Article
- ISSN
- 1042-9832
No coin nor oath required. For personal study only.
✦ Synopsis
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 problem arises in statistics where random samples are rc used to decide whether two attributes are independent. In this paper, we present a Markov chain Monte Carlo algorithm for this problem and give the first general polynomial bounds on its running time.
📜 SIMILAR VOLUMES
A modified exact test is proposed for 2 x 2 contingency tables. This test, which is based on a lees connervative definition of the concept of significance (STONE, 106s) is compared with a modified form of Pearson's X\* test and with Tocher's randomized exact (UMPU) test. The sizes of the new test li
Three approximations to the power function of the chi-square teat for the hypothema of 'no three factor interaction' in a 2 x2 x2 contingency table are introduced and compared. The firat method is baaed on the aampling distribution of the logarithm of the odds ratio, the second-on the noncentral dis