Random generation of 2�n contingency tables
From MaRDI portal
Publication:4705324
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1098-2418(199808)13:1<71::AID-RSA4>3.0.CO;2-P" /><71::AID-RSA4>3.0.CO;2-P 10.1002/(SICI)1098-2418(199808)13:1<71::AID-RSA4>3.0.CO;2-PzbMath0961.60074OpenAlexW2062142815MaRDI QIDQ4705324
Publication date: 19 December 1999
Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199808)13:1<71::aid-rsa4>3.0.co;2-p
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Contingency tables (62H17)
Related Items (7)
On the mixing time of the Diaconis-Gangolli random walk on contingency tables over \(\mathbb{Z}/q\mathbb{Z} \) ⋮ Markov chain Monte Carlo exact tests for incomplete two-way contingency tables ⋮ Random generation of \(2 \times 2 \times\dots \times 2 \times J\) contingency tables ⋮ A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant ⋮ Minimal invariant Markov basis for sampling contingency tables with fixed marginals ⋮ Polynomial time perfect sampling algorithm for two-rowed contingency tables ⋮ Polynomial-time counting and sampling of two-rowed contingency tables
This page was built for publication: Random generation of 2�n contingency tables
