On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries
From MaRDI portal
Publication:5323079
DOI10.1007/978-3-642-02882-3_31zbMath1248.62094MaRDI QIDQ5323079
Nayantara Bhatnagar, Ivona Bezáková, Dana Randall
Publication date: 23 July 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02882-3_31
62H17: Contingency tables
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Testing for independence in a two-way table: New interpretations of the chi-square statistic
- Random generation of combinatorial structures from a uniform distribution
- Approximate counting, uniform generation and rapidly mixing Markov chains
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
- Bounds on the L 2 Spectrum for Markov Chains and Markov Processes: A Generalization of Cheeger's Inequality
- Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows
- Approximate counting by dynamic programming
- Approximately counting integral flows and cell-bounded contingency tables
- Sampling contingency tables
- Improved bounds for sampling contingency tables
- Sampling binary contingency tables with a greedy start
- A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant
