Some characterizations of minimal Markov basis for sampling from discrete conditional distributions
By Akimichi Takemura, Satoshi Aoki. 2004
84 citations recorded by the source corpus.
Subfields: Algebra and Number Theory, Computational Theory and Mathematics, Discrete Mathematics and Combinatorics
View Paper: https://www.semanticscholar.org/paper/74cabf73757ad04be66f43b92a0963fc9c870315
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
- Akimichi Takemura
- Satoshi Aoki
- Takayuki Hibi
- Hidefumi Ohsugi
- Jürgen Herzog
- Seth Sullivant
- Adam Van Tuyl
In Computational Theory and Mathematics
In Discrete Mathematics and Combinatorics
Citations in the corpus
- Minimal Basis for a Connected Markov Chain over 3 × 3 ×K Contingency Tables with Fixed Two‐Dimensional Marginals (2003, background): “Properties and uniqueness of a minimal basis are investigated in Takemura & Aoki (2002). c© 2003 Australian Statistical Publishing Association Inc. 242 SATOSHI AOKI AND AKIMICHI TAKEMURA We use the following abbreviations from now on: wlog for ‘without loss of generality’; and wcne for ‘without…”
- Markov chain Monte Carlo exact tests for incomplete two-way contingency tables (2005, methodology): “As another approach, a Markov chain Monte Carlo approach is extensively used in various settings of contingency tables, for example, Besag and Clifford [3] for performing significance tests for the Ising model (two-way binary tables); Smith et al. [4] for tests of independence, quasi-independence, a”
- Toric Ideals Arising from Contingency Tables (2007, background): “On the other hand, a binomial f belonging to IA is called indispensable ([20] and [16]) if, for an arbitrary system F of binomial generators of IA, either f or−f appears in F .”