|
|||||
|
|
Polynomial time perfect sampling algorithm for two‐rowed contingency tables |
|
| Authors: | Shuji Kijima Tomomi Matsui |
| Abstract: | This paper proposes a polynomial time perfect (exact) sampling algorithm for 2 × n contingency tables. The algorithm is based on monotone coupling from the past (monotone CFTP) algorithm. The expected running time is bounded by O(n3 lnN) where n is the number of columns and N is the total sum of all entries. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2006 |
| Keywords: | Markov chains perfect sampling contingency tables coupling from the past path coupling |