Random generation of \(2 \times 2 \times\dots \times 2 \times J\) contingency tables
From MaRDI portal
Publication:703540
DOI10.1016/j.tcs.2004.06.014zbMath1094.62072MaRDI QIDQ703540
Yoko Ono, Tomomi Matsui, Yasuko Matsui
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
60J22: Computational methods in Markov chains
65C40: Numerical analysis or methods applied to Markov chains
62H17: Contingency tables
Related Items
Polynomial time approximate or perfect samplers for discretized Dirichlet distribution, Perfect sampling on contingency tables with an application to SAGE data, Random sampling of contingency tables via probabilistic divide-and-conquer, On the mixing time of the Diaconis-Gangolli random walk on contingency tables over \(\mathbb{Z}/q\mathbb{Z} \)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Network Algorithm for Performing Fisher's Exact Test in r × c Contingency Tables
- Testing for independence in a two-way table: New interpretations of the chi-square statistic
- An application of Harnack inequalities to random walk on nilpotent quotients
- Polynomial-time counting and sampling of two-rowed contingency tables
- A survey of exact inference for contingency tables. With comments and a rejoinder by the author
- Algebraic algorithms for sampling from conditional distributions
- Some characterizations of minimal Markov basis for sampling from discrete conditional distribu\-tions
- Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows
- A fast procedure for model search in multidimensional contingency tables
- Three-dimensional Statistical Data Security Problems
- Minimal Basis for a Connected Markov Chain over 3 x 3 x K Contingency Tables with Fixed Two-Dimensional Marginals
- The Logic of Inductive Inference
- A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries
