Some characterizations of minimal Markov basis for sampling from discrete conditional distribu\-tions
From MaRDI portal
Publication:1881002
DOI10.1007/BF02530522zbMATH Open1049.62068MaRDI QIDQ1881002FDOQ1881002
Authors: Akimichi Takemura, Satoshi Aoki 
Publication date: 27 September 2004
Published in: Annals of the Institute of Statistical Mathematics (Search for Journal in Brave)
Recommendations
- Minimal invariant Markov basis for sampling contingency tables with fixed marginals
- scientific article; zbMATH DE number 4107914
- Characterization theorems for some discrete distributions based on conditional structure
- Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo
- Efficient sampling of conditioned Markov jump processes
Contingency tables (62H17) Characterization and structure theory of statistical distributions (62E10) Sufficient statistics and fields (62B05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Network Algorithm for Performing Fisher's Exact Test in r × c Contingency Tables
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algebraic algorithms for sampling from conditional distributions
- Minimal Basis for a Connected Markov Chain over 3 x 3 x K Contingency Tables with Fixed Two-Dimensional Marginals
- Markov chain Monte Carlo exact tests for incomplete two-way contingency tables
- Title not available (Why is that?)
- Minimal systems of generators for ideals of semigroups
- A divide-and-conquer algorithm for generating Markov bases of multi-way tables
- The Diaconis-Sturmfels algorithm and rules of succession
- Performing the Exact Test of Hardy-Weinberg Proportion for Multiple Alleles
Cited In (42)
- On pseudo symmetric monomial curves
- Conditional inference given partial information in contingency tables using Markov bases
- On decomposable semigroups and applications.
- Markov chain Monte Carlo exact tests for incomplete two-way contingency tables
- Some rapidly mixing hit-and-run samplers for latent counts in linear inverse problems
- Markov chain Monte Carlo tests for designed experiments
- On the generalized Scarf complex of lattice ideals
- Markov bases of conditional independence models for permutations
- Matroid toric ideals: complete intersection, minors, and minimal systems of generators
- On connectivity of fibers with positive marginals in multiple logistic regression
- Perturbation method for determining the group of invariance of hierarchical models
- Combinatorial degree bound for toric ideals of hypergraphs
- Markov bases for typical block effect models of two-way contingency tables
- Indispensable binomials in semigroup ideals
- Minimal Markov basis for tests of main effect models for \(2^{p-1}\) fractional factorial designs of resolution \(p\)
- Minimal and minimal invariant Markov bases of decomposable models for contingency tables
- Multicanonical MCMC for sampling rare events: an illustrative review
- Distance-reducing Markov bases for sampling from a discrete sample space
- Generalized robust toric ideals
- Markov bases and generalized Lawrence liftings
- Exact test of goodness of fit for binomial distribution
- Indispensable monomials of toric ideals and Markov bases
- Markov bases for noncommutative Fourier analysis of ranked data
- Minimal invariant Markov basis for sampling contingency tables with fixed marginals
- Algebraic exact inference for rater agreement models
- Random generation of \(2 \times 2 \times\dots \times 2 \times J\) contingency tables
- Minimal generators of toric ideals of graphs
- Syzygies for Metropolis base chains
- Open problems on connectivity of fibers with positive margins in multi-dimensional contingency tables
- On free resolutions of some semigroup rings
- A generalization of the integer linear infeasibility problem
- INDISPENSABLE BINOMIALS OF FINITE GRAPHS
- The Markov complexity of book graphs
- A semigroup defining the Gröbner degeneration of a toric ideal
- Markov bases and toric ideals for some contingency tables
- Markov basis and Gröbner basis of Segre-Veronese configuration for testing independence in group-wise selections
- Gluing semigroups and strongly indispensable free resolutions
- Minimal systems of binomial generators and the indispensable complex of a toric ideal
- Orbit-based conditional tests. A link between permutations and Markov bases
- The largest group of invariance for Markov bases and toric ideals
- LIFTINGS OF A MONOMIAL CURVE
- Minimal Basis for a Connected Markov Chain over 3 x 3 x K Contingency Tables with Fixed Two-Dimensional Marginals
This page was built for publication: Some characterizations of minimal Markov basis for sampling from discrete conditional distribu\-tions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1881002)
