A Genuinely Polynomial-time Algorithm for Sampling Two-rowed Contingency Tables (extended Abstract)
نویسندگان
چکیده
In this paper a Markov chain for contingency tables with two rows is deened. The chain is shown to be rapidly mixing using the path coupling method. The mixing time of the chain is quadratic in the number of columns and linear in the logarithm of the table sum. Two extensions of the new chain are discussed: one for three-rowed contingency tables and one for m-rowed contingency tables. We show that, unfortunately, it is not possible to prove rapid mixing for these chains by simply extending the path coupling approach used in the two-rowed case.
منابع مشابه
MATHEMATICAL ENGINEERING TECHNICAL REPORTS Polynomial Time Perfect Sampling Algorithm for Two-rowed Contingency Tables
This paper proposes a polynomial time perfect (exact) sampling algorithm for 2×n contingency tables. Our algorithm is a Las Vegas type randomized algorithm and the expected running time is bounded by O(n ln N) where n is the number of columns and N is the total sum of whole entries in a table. The algorithm is based on monotone coupling from the past (monotone CFTP) algorithm and new Markov cha...
متن کاملPolynomial time perfect sampling algorithm for two-rowed contingency tables
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(n lnN) where n is the number of columns and N is the total sum of all entries.
متن کاملPolynomial-time counting and sampling of two-rowed contingency tables
In this paper a Markov chain for contingency tables with two rows is defined. The chain is shown to be rapidly mixing using the path coupling method. We prove an upper bound for the mixing time of the chain. The upper bound is quadratic in the number of columns and linear in the logarithm of the table sum. By considering a specific problem, we prove a lower bound for the mixing time of the chai...
متن کاملApproximate Counting Scheme for m X n Contingency Tables
In this paper, we propose a new counting scheme for m × n contingency tables. Our scheme is a modification of Dyer and Greenhill’s scheme for two rowed contingency tables [5]. We can estimate not only the sizes of error, but also the sizes of the bias of the number of tables obtained by our scheme, on the assumption that we have an approximate sampler. key words: counting, approximation, #P-com...
متن کاملApproximate Counting Scheme
In this paper, we propose a new counting scheme for m× n contingency tables. Our scheme is a modification of Dyer and Greenhill’s scheme for two rowed contingency tables [5]. We can estimate not only the sizes of error, but also the sizes of the bias of the number of tables obtained by our scheme, on the assumption that we have an approximate sampler.
متن کامل