Sampling contingency tables
From MaRDI portal
Publication:1713620
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Sampling theory, sample surveys (62D05) Contingency tables (62H17) Directed graphs (digraphs), tournaments (05C20) Random walks on graphs (05C81)
Recommendations
- Random generation of 2 2 2 J contingency tables
- Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows
- Improved bounds for sampling contingency tables
- scientific article; zbMATH DE number 1223716
- On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries
Cites work
- scientific article; zbMATH DE number 3169205 (Why is no real title available?)
- scientific article; zbMATH DE number 1334601 (Why is no real title available?)
- scientific article; zbMATH DE number 795108 (Why is no real title available?)
- A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs
- An Application of Markov Chain Monte Carlo to Community Ecology
- Approximating the Permanent
- Counting the Number of r × c Contingency Tables with Fixed Margins
- Matrices of zeros and ones with fixed row and column sum vectors
- On sampling with Markov chains
- Sampling Regular Graphs and a Peer-to-Peer Network
- Sequential Monte Carlo Methods for Statistical Analysis of Tables
- Testing for independence in a two-way table: New interpretations of the chi-square statistic
Cited in
(11)- On the mixing time of the Diaconis-Gangolli random walk on contingency tables over \(\mathbb{Z}/q\mathbb{Z} \)
- Structure and eigenvalues of heat-bath Markov chains
- Rejection sampling of bipartite graphs with given degree sequence
- Generalized dominoes tiling's Markov chain mixes fast
- Random transpositions on contingency tables
- Statistical evidence in contingency tables analysis
- Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows
- On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries
- Random generation of 2 2 2 J contingency tables
- On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries
- T-tetrominoes Tiling's Markov chain mixes fast
This page was built for publication: Sampling contingency tables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1713620)