On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries

DOI10.1007/s10878-010-9323-9zbMath1279.62030OpenAlexW2149397467MaRDI QIDQ652625

Dana Randall, Nayantara Bhatnagar, Ivona Bezáková

Publication date: 15 December 2011

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-010-9323-9

zbMATH Keywords

Markov chainscontingency tablesFPRASmixing ratescell bounds

Mathematics Subject Classification ID

Sampling theory, sample surveys (62D05) Contingency tables (62H17)

Related Items (2)

New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling ⋮ A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Testing for independence in a two-way table: New interpretations of the chi-square statistic
• Random generation of combinatorial structures from a uniform distribution
• Approximate counting, uniform generation and rapidly mixing Markov chains
• Bounds on the L 2 Spectrum for Markov Chains and Markov Processes: A Generalization of Cheeger's Inequality
• Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows
• Approximate counting by dynamic programming
• Approximately counting integral flows and cell-bounded contingency tables
• Sampling contingency tables
• Improved bounds for sampling contingency tables
• Sampling binary contingency tables with a greedy start
• A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant

This page was built for publication: On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries