On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries

DOI10.1007/978-3-642-02882-3_31MaRDI QIDQ5323079zbMATH OpenOpenAlexFDO

Authors Ivona Bezáková, Nayantara Bhatnagar, Dana Randall

Publication date 23 July 2009

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

Full work available at URL https://doi.org/10.1007/978-3-642-02882-3_31

Mathematics Subject Classification ID

Contingency tables (62H17)

Recommendations

• On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries
• Sampling contingency tables
• Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows
• On sampling with Markov chains
• scientific article; zbMATH DE number 1223716

Cites work

• A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant
• A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
• Approximate counting by dynamic programming
• Approximate counting, uniform generation and rapidly mixing Markov chains
• Approximately counting integral flows and cell-bounded contingency tables
• Bounds on the L 2 Spectrum for Markov Chains and Markov Processes: A Generalization of Cheeger's Inequality
• scientific article; zbMATH DE number 1334601 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 795108 (Why is no real title available?)
• Improved bounds for sampling contingency tables
• Random generation of combinatorial structures from a uniform distribution
• Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows
• Sampling binary contingency tables with a greedy start
• Sampling contingency tables
• Testing for independence in a two-way table: New interpretations of the chi-square statistic

Cited in

(5)

• Sampling contingency tables
• On the mixing time of the Diaconis-Gangolli random walk on contingency tables over \(\mathbb{Z}/q\mathbb{Z} \)
• Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows
• Speeding up switch Markov chains for sampling bipartite graphs with given degree sequence
• On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries

This page was built for publication: On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries

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