Polynomial time perfect sampling algorithm for two-rowed contingency tables
This paper proposes a polynomial time perfect (exact) sampling algorithm for 2 x n contingency tables. The algorithm is based on monotone coupling from the past (monotone CFTP) algorithm. The expected running time is bounded by O(n(3) In N) where n is the number of columns and N is the total sum of all entries. (c) 2005 Wiley Periodicals, Inc.
perfect sampling contingency tables coupling from the past markov chains path coupling