Polynomial-time counting and sampling of two-rowed contingency tables
Authors:
- 1 September 2000
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 246 (1-2) , 265-278
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Path coupling: A technique for proving rapid mixing in Markov chains2002
- A more rapidly mixing Markov chain for graph coloringsRandom Structures & Algorithms, 1998
- Random generation of 2×n contingency tablesRandom Structures & Algorithms, 1998
- A genuinely polynomial-time algorithm for sampling two-rowed contingency tables1998
- Sampling contingency tablesRandom Structures & Algorithms, 1997
- On sampling with Markov chainsRandom Structures & Algorithms, 1996
- Computing the volume of convex bodies: a case where randomness provably helps1991
- Testing for Independence in a Two-Way Table: New Interpretations of the Chi-Square StatisticThe Annals of Statistics, 1985
- Monte-Carlo algorithms for enumeration and reliability problems1983
- The Analysis of Categorical Data from Complex Sample Surveys: Chi-Squared Tests for Goodness of Fit and Independence in Two-Way TablesJournal of the American Statistical Association, 1981