Sampling contingency tables

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1098-2418(199707)10:4<487::AID-RSA4>3.0.CO;2-Q" /><487::AID-RSA4>3.0.CO;2-Q 10.1002/(SICI)1098-2418(199707)10:4<487::AID-RSA4>3.0.CO;2-QzbMath0884.62065OpenAlexW1970853627MaRDI QIDQ4345364

John A. Mount, Martin Dyer, Ravindran Kannan

Publication date: 5 April 1998

Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199707)10:4<487::aid-rsa4>3.0.co;2-q

zbMATH Keywords

random samplingcontingency tablescontingency polytope

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Contingency tables (62H17) Complexity and performance of numerical algorithms (65Y20)

Related Items (26)

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 ⋮ Exact sampling and counting for fixed-margin matrices ⋮ On the mixing time of the Diaconis-Gangolli random walk on contingency tables over \(\mathbb{Z}/q\mathbb{Z} \) ⋮ Asymptotic enumeration of integer matrices with large equal row and column sums ⋮ Lower bounds for contingency tables via Lorentzian polynomials ⋮ Computation of Exact Bootstrap Confidence Intervals: Complexity and Deterministic Algorithms ⋮ 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 ⋮ Characterizing optimal sampling of binary contingency tables via the configuration model ⋮ Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums ⋮ Uniformly Generating Origin Destination Tables ⋮ Counting subsets of contingency tables ⋮ Approximating the volume of tropical polytopes is difficult ⋮ Random generation of \(2 \times 2 \times\dots \times 2 \times J\) contingency tables ⋮ The many aspects of counting lattice points in polytopes ⋮ What Does a Random Contingency Table Look Like? ⋮ Random walks on the vertices of transportation polytopes with constant number of sources ⋮ On the complexity of computing Kostka numbers and Littlewood-Richardson coefficients ⋮ A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant ⋮ Majorization and the number of bipartite graphs for given vertex degrees ⋮ A Nonparametric Test for Symmetry Based on Freeman and Halton's Ideas on Contingency Tables ⋮ An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums ⋮ On the number of faces of certain transportation polytopes ⋮ Polynomial-time counting and sampling of two-rowed contingency tables ⋮ On the computational complexity of reconstructing lattice sets from their \(X\)-rays

This page was built for publication: Sampling contingency tables