Polynomial time approximate or perfect samplers for discretized Dirichlet distribution
type: Item
instance of: scholarly article
title: Polynomial time approximate or perfect samplers for discretized Dirichlet distribution
zbMATH Open document ID: 1204.60068
author: Tomomi Matsui
author: Mitsuo Motoki
author: Naoyuki Kamatani
author: Shuji Kijima
published in: Japan Journal of Industrial and Applied Mathematics
publication date: 2011-02-08T00:00:00Z
Mathematics Subject Classification ID: 60J10
Mathematics Subject Classification ID: 60J22
zbMATH DE Number: 5847836
zbMATH Keywords: Markov chains
zbMATH Keywords: Dirichlet distribution
zbMATH Keywords: path coupling
zbMATH Keywords: coupling from the past
zbMATH Keywords: perfect simulation
describes a project that uses: STRUCTURE
MaRDI profile type: Publication
full work available at URL: s13160-010-0002-0
OpenAlex ID: W2078147999
cites work: Q2701738
cites work: Quasi-equilibrium theory for the distribution of rare alleles in a subdivided population: Justification and implications
cites work: Markov chain Monte Carlo and models of consideration set and parameter heterogeneity
cites work: Polynomial-time counting and sampling of two-rowed contingency tables
cites work: A Guide to Exact Simulation
cites work: Biological Sequence Analysis
cites work: An interruptible algorithm for perfect sampling via Markov chains
cites work: Q4521550
cites work: Polynomial time perfect sampling algorithm for two-rowed contingency tables
cites work: Q5485309
cites work: Disjoint Decomposition of Markov Chains and Sampling Circuits in Cayley Graphs
cites work: Algorithms and Computation
cites work: Random generation of \(2 \times 2 \times\dots \times 2 \times J\) contingency tables
cites work: Exact sampling with coupled Markov chains and applications to statistical mechanics
cites work: How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
cites work: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
cites work: Q2732653
cites work: How to couple from the past using a read-once source of randomness
DOI: 10.1007/S13160-010-0002-0
description: scientific article; zbMATH DE number 5847836