Polynomial time approximate or perfect samplers for discretized Dirichlet distribution
DOI10.1007/S13160-010-0002-0zbMATH Open1204.60068OpenAlexW2078147999MaRDI QIDQ623726FDOQ623726
Authors: Tomomi Matsui, Mitsuo Motoki, Naoyuki Kamatani, Shuji Kijima 
Publication date: 8 February 2011
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13160-010-0002-0
Recommendations
- Algorithms and Computation
- Rapidly mixing chain and perfect sampler for logarithmic separable concave distributions on simplex
- \(L _{ \infty }\)-discrepancy analysis of polynomial-time deterministic samplers emulating rapidly mixing chains
- Practical perfect sampling using composite bounding chains: the Dirichlet-multinomial model
- Exact sampling with coupled Markov chains and applications to statistical mechanics
Computational methods in Markov chains (60J22) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Cites Work
- Title not available (Why is that?)
- Biological Sequence Analysis
- Title not available (Why is that?)
- Exact sampling with coupled Markov chains and applications to statistical mechanics
- How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
- An interruptible algorithm for perfect sampling via Markov chains
- Title not available (Why is that?)
- Quasi-equilibrium theory for the distribution of rare alleles in a subdivided population: Justification and implications
- Markov chain Monte Carlo and models of consideration set and parameter heterogeneity
- Polynomial-time counting and sampling of two-rowed contingency tables
- Polynomial time perfect sampling algorithm for two-rowed contingency tables
- A Guide to Exact Simulation
- How to couple from the past using a read-once source of randomness
- Algorithms and Computation
- Disjoint Decomposition of Markov Chains and Sampling Circuits in Cayley Graphs
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Rapidly mixing chain and perfect sampler for logarithmic separable concave distributions on simplex
- Random generation of \(2 \times 2 \times\dots \times 2 \times J\) contingency tables
Cited In (7)
- Algorithms and Computation
- Practical perfect sampling using composite bounding chains: the Dirichlet-multinomial model
- Exact sublinear binomial sampling
- \(L _{ \infty }\)-discrepancy analysis of polynomial-time deterministic samplers emulating rapidly mixing chains
- Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers
- Rapidly mixing chain and perfect sampler for logarithmic separable concave distributions on simplex
- Exact Sublinear Binomial Sampling
Uses Software
This page was built for publication: Polynomial time approximate or perfect samplers for discretized Dirichlet distribution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q623726)
