Sampling contingency tables
Let be the set of all matrices, where and are the sums of entries in row and column , respectively. Sampling efficiently uniformly at random elements of is a problem with interesting applications in Combinatorics and Statistics. To calibrate the statistic for testing independence, Diaconis and Gango...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2018-12-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2017.10.001 |