Improved bounds for sampling contingency tables
From MaRDI portal
Recommendations
Cites work
Cited in
(22)- Resampling for statistical confidentiality in contingency tables
- Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums
- Enumerating Contingency Tables via Random Permanents
- Linear-time uniform generation of random sparse contingency tables with specified marginals
- 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 integer matrices with large equal row and column sums
- What does a random contingency table look like?
- Sampling contingency tables
- Polynomial-time counting and sampling of two-rowed contingency tables
- An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums
- Exact sampling and counting for fixed-margin matrices
- Improved Estimation in a Contingency Table: Independence Structure
- Sampling binary contingency tables with a greedy start
- An approximation algorithm for counting contingency tables
- scientific article; zbMATH DE number 2127729 (Why is no real title available?)
- On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries
- Phase transition in random contingency tables with non-uniform margins
- Rapid calculation of exact cell bounds for contingency tables from conditional frequencies
- Random sampling of contingency tables via probabilistic divide-and-conquer
- Characterizing optimal sampling of binary contingency tables via the configuration model
- Polynomial time perfect sampling algorithm for two-rowed contingency tables
This page was built for publication: Improved bounds for sampling contingency tables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4803313)
