Markov chain Monte Carlo exact tests for incomplete two-way contingency tables

By Satoshi Aoki, Akimichi Takemura. 2005

47 citations recorded by the source corpus.

Subfields: Algebra and Number Theory, Computational Mathematics, Discrete Mathematics and Combinatorics

View Paper: https://www.semanticscholar.org/paper/d835d87107966a9e772cdbbceb74d04730cfbb8e

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Algebra and Number Theory

1. Akimichi Takemura
2. Satoshi Aoki
3. Seth Sullivant
4. Mathias Drton
5. Bernd Sturmfels
6. Adam Van Tuyl

In Computational Mathematics

1. Seth Sullivant
2. Mathias Drton
3. Akimichi Takemura
4. Satoshi Aoki
5. Bernd Sturmfels
6. Christopher J. Hillar

In Discrete Mathematics and Combinatorics

1. Akimichi Takemura
2. Satoshi Aoki
3. Mathias Drton

Citations in the corpus

• Some characterizations of minimal Markov basis for sampling from discrete conditional distributions (2004, methodology): “We study this question on two-way tables with structural zeros in our subsequent work ( Aoki and Takemura (2002) ).”
• Algebraic statistical models (2007, background): “Other recent work in algebraic statistics has considered contingency table analysis (Dobra and Sullivant (2004), Aoki and Takemura (2005) and Takemura and Aoki (2005)), phylogenetic tree models (Eriksson et al.”