Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows

DOI10.1137/S0097539703434243MaRDI QIDQ3427745zbMATH OpenDBLPWikidataFDO

Authors Mary Cryan, Martin Dyer, Leslie Ann Goldberg, Russell Martin, Mark Jerrum

Publication date 27 March 2007

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0097539703434243

zbMATH Keywords

contingency tableMarkov chainrapid mixing

Mathematics Subject Classification ID

Other designs, configurations (05B30) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Contingency tables (62H17) Numerical analysis or methods applied to Markov chains (65C40)

Recommendations

• scientific article; zbMATH DE number 1223716
• Polynomial-time counting and sampling of two-rowed contingency tables
• Sampling contingency tables
• Random generation of 2 2 2 J contingency tables
• On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries

Cited in

(27)

• Polynomial-time counting and sampling of two-rowed contingency tables
• Sampling contingency tables
• A faster FPTAS for counting two-rowed contingency tables
• On the mixing time of the Diaconis-Gangolli random walk on contingency tables over \(\mathbb{Z}/q\mathbb{Z} \)
• Hit and run as a unifying device
• Heat-bath random walks with Markov bases
• Structure and eigenvalues of heat-bath Markov chains
• Markov bases of three-way tables are arbitrarily complicated
• Lower bounds for contingency tables via Lorentzian polynomials
• An approximation algorithm for counting contingency tables
• Random walks on the vertices of transportation polytopes with constant number of sources
• scientific article; zbMATH DE number 1223716 (Why is no real title available?)
• scientific article; zbMATH DE number 1789923 (Why is no real title available?)
• New classes of degree sequences with fast mixing swap Markov chain sampling
• On sampling with Markov chains
• What does a random contingency table look like?
• Power analysis of independence testing for three-way contingency tables of small sizes
• Some contributions to practice of \(2\times 2\) contingency tables
• A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix
• On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries
• Sampling binary contingency tables with a greedy start
• A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant
• On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries
• Linear-time uniform generation of random sparse contingency tables with specified marginals
• Random transpositions on contingency tables
• Random generation of 2 2 2 J contingency tables
• Random sampling of contingency tables via probabilistic divide-and-conquer

This page was built for publication: Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows

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