Improved bounds for sampling contingency tables

DOI10.1002/rsa.10049zbMath1031.62047OpenAlexW2137520161MaRDI QIDQ4803313

Ben Morris

Publication date: 2 April 2003

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.10049

Mathematics Subject Classification ID

Related Items (10)

Rapid calculation of exact cell bounds for contingency tables from conditional frequencies ⋮ On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries ⋮ Asymptotic enumeration of integer matrices with large equal row and column sums ⋮ On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries ⋮ Analysis of convergence rates of some Gibbs samplers on continuous state spaces ⋮ Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums ⋮ An approximation algorithm for counting contingency tables ⋮ Enumerating Contingency Tables via Random Permanents ⋮ An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums ⋮ Random sampling of contingency tables via probabilistic divide-and-conquer

Cites Work

• Unnamed Item
• Faster mixing via average conductance

This page was built for publication: Improved bounds for sampling contingency tables