Random generation of 2 2 2 J contingency tables

DOI10.1016/J.TCS.2004.06.014MaRDI QIDQ703540zbMATHOpenAlexFDO

Authors Tomomi Matsui, Yasuko Matsui, Yoko Ono

Publication date 11 January 2005

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2004.06.014

zbMATH Keywords

Markov chain Monte CarloContingency tablePath couplingRapidly mixing

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Numerical analysis or methods applied to Markov chains (65C40) Contingency tables (62H17)

Recommendations

• Random generation of 2�n contingency tables
• scientific article; zbMATH DE number 1223716
• Sampling contingency tables
• Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows
• Polynomial-time counting and sampling of two-rowed contingency tables

Cites work

• scientific article; zbMATH DE number 1566488 (Why is no real title available?)
• scientific article; zbMATH DE number 1807484 (Why is no real title available?)
• scientific article; zbMATH DE number 1817585 (Why is no real title available?)
• scientific article; zbMATH DE number 3812655 (Why is no real title available?)
• scientific article; zbMATH DE number 795108 (Why is no real title available?)
• scientific article; zbMATH DE number 6472593 (Why is no real title available?)
• A Network Algorithm for Performing Fisher's Exact Test in r × c Contingency Tables
• A fast procedure for model search in multidimensional contingency tables
• A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries
• A survey of exact inference for contingency tables. With comments and a rejoinder by the author
• Algebraic algorithms for sampling from conditional distributions
• An application of Harnack inequalities to random walk on nilpotent quotients
• Minimal Basis for a Connected Markov Chain over 3 x 3 x K Contingency Tables with Fixed Two-Dimensional Marginals
• On sampling with Markov chains
• Polynomial-time counting and sampling of two-rowed contingency tables
• Random generation of 2�n contingency tables
• Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows
• Sampling contingency tables
• Some characterizations of minimal Markov basis for sampling from discrete conditional distribu\-tions
• Testing for independence in a two-way table: New interpretations of the chi-square statistic
• The Logic of Inductive Inference
• Three-dimensional Statistical Data Security Problems

Cited in

(10)

• Linear-time uniform generation of random sparse contingency tables with specified marginals
• Random transpositions on contingency tables
• On the mixing time of the Diaconis-Gangolli random walk on contingency tables over \(\mathbb{Z}/q\mathbb{Z} \)
• Polynomial time approximate or perfect samplers for discretized Dirichlet distribution
• Sampling contingency tables
• Polynomial-time counting and sampling of two-rowed contingency tables
• Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows
• Perfect sampling on contingency tables with an application to SAGE data
• On uniform generation of two-way tables with fixed margins and the conditional volume test of Diaconis and Efron
• Random sampling of contingency tables via probabilistic divide-and-conquer

This page was built for publication: Random generation of \(2 \times 2 \times\dots \times 2 \times J\) contingency tables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703540)