Perfect sampling algorithm for small m × n contingency tables

摘要

A Markov chain is proposed that uses coupling from the past sampling algorithm for sampling m × n contingency tables. This method is an extension of the one proposed by Kijima and Matsui (Rand. Struct. Alg., 29:243-256, 2006). It is not polynomial, as it is based upon a recursion, and includes a rejection phase but can be used for practical purposes on small contingency tables as illustrated in a classical 4×4 example.