A genuinely polynomial-time algorithm for sampling two-rowed contingency tables

DOI10.1007/BFB0055065MaRDI QIDQ4219031zbMATH OpenFDO

Authors Martin Dyer, Catherine Greenhill

Publication date 7 July 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0055065

zbMATH Keywords

contingency tablespath coupling

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Contingency tables (62H17) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• Polynomial-time counting and sampling of two-rowed contingency tables
• Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows
• Random generation of 2 2 2 J contingency tables
• scientific article; zbMATH DE number 2127729

Cited in

(12)

• Polynomial-time counting and sampling of two-rowed contingency tables
• Sampling contingency tables
• scientific article; zbMATH DE number 2127729 (Why is no real title available?)
• Polynomial time perfect sampling algorithm for two-rowed contingency tables
• Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows
• scientific article; zbMATH DE number 5280093 (Why is no real title available?)
• On sampling with Markov chains
• On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries
• Sampling binary contingency tables with a greedy start
• On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries
• Random transpositions on contingency tables
• Random generation of 2 2 2 J contingency tables

This page was built for publication: A genuinely polynomial-time algorithm for sampling two-rowed contingency tables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4219031)